mlsanityData to 7 Oct 2026

Stochastic Subgradient Descent Escapes Active Strict Saddles on Weakly Convex Functions

arXiv 2108.02072 ↗First posted 4 Aug 2021math.OC stat.MLcited by 9

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

  1. 2018Stochastic subgradient method converges on tame functionscited by 120
  2. 2019Conservative set valued fields, automatic differentiation, stochastic gradient method and deep learningcited by 71
  3. 2017Stochastic Methods for Composite and Weakly Convex Optimization Problemscited by 48
  4. 2020A mathematical model for automatic differentiation in machine learningcited by 44
  5. 2018Bandit learning in concave N-person gamescited by 32
  6. 2020Convergence of constant step stochastic gradient descent for non-smooth non-convex functionscited by 27
  7. 2018Analysis of nonsmooth stochastic approximation: the differential inclusion approachcited by 21
  8. 2019Stochastic algorithms with geometric step decay converge linearly on sharp functionscited by 14
  9. 2019Pathological subgradient dynamicscited by 9
  10. 2015Generic minimizing behavior in semi-algebraic optimizationcited by 5
  11. 2021Stochastic proximal subgradient descent oscillates in the vicinity of its accumulation setcited by 2

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2021: 2; 2022: 0; 2023: 3; 2024: 3; 2025: 0; 2026: 1.

9 papers.