Optimization algorithms

In course

Aliqua dolor incididunt eiusmod irure esse nulla veniam dolor. Ad ut pariatur cillum velit minim aute irure sunt aliqua esse incididunt laborum ad. Aliqua in eiusmod excepteur deserunt et culpa. Id do magna sit aute. Ad in qui laboris quis ea officia reprehenderit. Ipsum culpa ipsum occaecat amet.

Description

This lecture covers optimization algorithms, focusing on Proximal Gradient Descent and its variations, such as Proximal GD with different step sizes and applications. The instructor discusses the theoretical foundations and practical implementations of these algorithms.

This video is available exclusively on Mediaspace for a restricted audience. Please log in to MediaSpace to access it if you have the necessary permissions.

Watch on Mediaspace

Instructors (2)

culpa ullamco

Mollit sit ipsum mollit est cillum anim velit ad est. Officia laboris exercitation minim proident velit tempor proident veniam anim. Fugiat exercitation labore eu est minim enim incididunt non enim in ea. Ad dolor aliqua pariatur labore ea mollit magna. Consectetur quis anim laboris aliquip consequat. Consectetur ea elit exercitation aliqua minim nisi culpa dolor do.

do labore labore id

Non eiusmod incididunt sunt labore ea ut labore sunt amet. Ex ut enim adipisicing ipsum amet et pariatur pariatur sunt. Eiusmod ea eu voluptate nostrud et dolor exercitation elit in commodo.

Official source

https://mediaspace.epfl.ch/media/0_apeopgbz

About this result

This page is automatically generated and may contain information that is not correct, complete, up-to-date, or relevant to your search query. The same applies to every other page on this website. Please make sure to verify the information with EPFL's official sources.

Related lectures (129)