Lecture

Optimization for Machine Learning: Accelerated Gradient Descent

Description

This lecture covers Accelerated Gradient Descent, Gradient-free optimization, and their applications in machine learning. It discusses the speed of gradient descent on smooth convex functions, the concept of Nesterov's accelerated gradient descent, error bounds, potential functions, and the convergence rate for derivative-free random search. Additionally, it explores adaptive and other SGD methods such as Adagrad, Adam, and SignSGD, highlighting their advantages and practical implications.

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.