Explore a 59-minute lecture on stochastic optimization algorithms with adaptive state-dependent variance for non-convex objective functions. Delve into the application of these methods in machine learning, where non-convex loss landscapes are prevalent. Learn about the dual-phase approach: an exploration phase followed by a faster converging algorithm in the basin of attraction. Discover how these techniques can be used independently, offering provable algebraic convergence rates optimal for the exploration phase. Examine numerical examples that complement the mathematical analysis, covering algorithms both with and without explicit use of gradient information. Gain insights from Björn Engquist's presentation at #ICBS2024, hosted by BIMSA, on achieving global convergence in stochastic optimization.
Global Convergence in Stochastic Optimization - ICBS 2024
Overview
Syllabus
Björn Engquist: Global Convergence in Stochastic Optimization #ICBS2024
Taught by
BIMSA
Related Courses
-
Large Scale Machine Learning and Convex Optimization - Lecture 3
-
Large Scale Machine Learning and Convex Optimization - Lecture 1
-
Can Learning Theory Resist Deep Learning? - Francis Bach, INRIA
-
Private Stochastic Optimization with Large Worst-Case Lipschitz Parameter
-
Stochastic Algorithms for Constrained Continuous Optimization
-
Distributed Stochastic Non-Convex Optimization - Optimal Regimes and Tradeoffs
