Lecture

Stochastic Optimization: Algorithms and Methods

Description

This lecture covers stochastic optimization and adaptive gradient methods, examining algorithms like gradient descent, coordinate descent, subgradient, proximal gradient, projection gradient, and mirror descent. It explores the solution of convex optimization problems with and without constraints, for both smooth and nonsmooth risks. The lecture delves into exploiting the structure of the risk function and the challenges posed by large datasets and unknown statistics. Various stochastic algorithms are discussed, including stochastic gradient, subgradient, and proximal gradient methods, highlighting their convergence properties and the impact of step sizes on convergence.

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.

Graph Chatbot

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.