Stochastic Subgradient Descent Escapes Active Strict Saddles on Weakly Convex Functions
Not on the map. Why?
Abstract (arXiv)
In non-smooth stochastic optimization, we establish the non-convergence of the stochastic subgradient descent (SGD) to the critical points recently called active strict saddles by Davis and Drusvyatskiy. Such points lie on a manifold M where the function f has a direction of second-order negative curvature. Off this manifold, the norm of the Clarke subdifferential of f is lower-bounded. We require two conditions on f. The first assumption is a Verdier stratification condition, which is a refinement of the popular Whitney stratification. It allows us to establish a reinforced version of the projection formula of Bolte et.al. for Whitney stratifiable functions, and which is of independent interest. The second assumption, termed the angle condition, allows to control the distance of the iterates to M. When f is weakly convex, our assumptions are generic. Consequently, generically in the class of definable weakly convex functions, the SGD converges to a local minimizer.
Key facts. Cited by 9 papers in the map (data through 7 Oct 2026). Builds on 11 of its 50 references that are in the map. First posted on arXiv 4 Aug 2021.
Builds on
11 of 50 references.
References · 11
- 2018Stochastic subgradient method converges on tame functionscited by 120
- 2019Conservative set valued fields, automatic differentiation, stochastic gradient method and deep learningcited by 71
- 2017Stochastic Methods for Composite and Weakly Convex Optimization Problemscited by 48
- 2020A mathematical model for automatic differentiation in machine learningcited by 44
- 2018Bandit learning in concave N-person gamescited by 32
- 2020Convergence of constant step stochastic gradient descent for non-smooth non-convex functionscited by 27
- 2018Analysis of nonsmooth stochastic approximation: the differential inclusion approachcited by 21
- 2019Stochastic algorithms with geometric step decay converge linearly on sharp functionscited by 14
- 2019Pathological subgradient dynamicscited by 9
- 2015Generic minimizing behavior in semi-algebraic optimizationcited by 5
- 2021Stochastic proximal subgradient descent oscillates in the vicinity of its accumulation setcited by 2
Built on by
Citing papers per year: 2021: 2; 2022: 0; 2023: 3; 2024: 3; 2025: 0; 2026: 1.
9 papers.
- 2021Active manifolds, stratifications, and convergence to local minima in nonsmooth optimizationcited by 11
- 2023Riemannian stochastic optimization methods avoid strict saddle pointscited by 8
- 2023Can Learning Be Explained By Local Optimality In Robust Low-rank Matrix Recovery?cited by 2
- 2021Stochastic Subgradient Descent on a Generic Definable Function Converges to a Minimizercited by 1
- 2023Piecewise Polynomial Regression of Tame Functions via Integer Programmingcited by 1
- 2024Avoiding strict saddle points of nonconvex regularized problemscited by 1
- 2024On the Hardness of Meaningful Local Guarantees in Nonsmooth Nonconvex Optimizationcited by 0
- 2024ℓ1-norm rank-one symmetric matrix factorization has no spurious second-order stationary pointscited by 0
- 2026Stochastic Saddle Avoidance Beyond Unit Excitation and Smoothness: A Pathwise Lyapunov-Perron Frameworkcited by 0
- 2026Stochastic Saddle Avoidance Beyond Unit Excitation and Smoothness: A Pathwise Lyapunov-Perron Framework4 Aug 2026
- 2024ℓ1-norm rank-one symmetric matrix factorization has no spurious second-order stationary points7 Oct 2024
- 2024On the Hardness of Meaningful Local Guarantees in Nonsmooth Nonconvex Optimization16 Sep 2024
- 2024Avoiding strict saddle points of nonconvex regularized problems17 Jan 2024
- 2023Piecewise Polynomial Regression of Tame Functions via Integer Programming22 Nov 2023
- 2023Riemannian stochastic optimization methods avoid strict saddle points4 Nov 2023
- 2023Can Learning Be Explained By Local Optimality In Robust Low-rank Matrix Recovery?21 Feb 2023
- 2021Stochastic Subgradient Descent on a Generic Definable Function Converges to a Minimizer6 Sep 2021
- 2021Active manifolds, stratifications, and convergence to local minima in nonsmooth optimization26 Aug 2021