Lecture

Proximal and Subgradient Descent: Optimization Techniques

Description

This lecture covers proximal and subgradient descent methods in optimization for machine learning. The instructor begins by introducing proximal gradient descent as an extension of projected gradient descent, explaining how it can handle non-differentiable functions. The lecture details the algorithm's update steps and the concept of subgradients, providing examples to illustrate these ideas. The instructor emphasizes the importance of understanding the convergence rates of these methods, particularly in the context of Lipschitz continuous functions and strong convexity. The lecture also discusses the optimality of first-order methods and the conditions under which these convergence rates can be achieved. Throughout the session, the instructor engages with the audience, addressing questions and clarifying concepts related to the algorithms presented. The lecture concludes with a discussion on the implications of bounded subgradients and the practical considerations for implementing these optimization techniques in machine learning applications.

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.