Lecture

Stochastic Gradient Descent Convergence Proof

Description

This lecture covers the convergence proof of Stochastic Gradient Descent (SGD) with strongly-convex functions. It explains the steps to show convergence with respect to the optimal solution, focusing on the recursive relationship between the estimates. The instructor presents the derivation of the terms C and D, and discusses the choice of a to achieve a convergent bound. The lecture concludes by analyzing the algorithm's approach to the limiting bound and the impact of using a decreasing step-size on convergence properties.

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.