mlsanityData to 7 Oct 2026

Backward error analysis and the qualitative behaviour of stochastic optimization algorithms: Application to stochastic coordinate descent

arXiv 2309.02082 ↗First posted 5 Sep 2023math.OC cs.NA math.NAcited by 5

Not on the map. Why?

Abstract (arXiv)

Stochastic optimization methods have been hugely successful in making large-scale optimization problems feasible when computing the full gradient is computationally prohibitive. Using the theory of modified equations for numerical integrators, we propose a class of stochastic differential equations that approximate the dynamics of general stochastic optimization methods more closely than the original gradient flow. Analyzing a modified stochastic differential equation can reveal qualitative insights about the associated optimization method. Here, we study mean-square stability of the modified equation in the case of stochastic coordinate descent.

Key facts. Cited by 5 papers in the map (data through 7 Oct 2026). Builds on 8 of its 34 references that are in the map. First posted on arXiv 5 Sep 2023.

Builds on

8 of 34 references.

References · 8

  1. 2016Optimization Methods for Large-Scale Machine Learningcited by 1,140
  2. 2019SGD: General Analysis and Improved Ratescited by 206
  3. 2021On the Origin of Implicit Regularization in Stochastic Gradient Descentcited by 183
  4. 2020Implicit Gradient Regularizationcited by 145
  5. 2018Stochastic Modified Equations and Dynamics of Stochastic Gradient Algorithms I: Mathematical Foundationscited by 109
  6. 2020Analysis of Stochastic Gradient Descent in Continuous Timecited by 24
  7. 2021On Riemannian Stochastic Approximation Schemes with Fixed Step-Sizecited by 12
  8. 2022Toward Equation of Motion for Deep Neural Networks: Continuous-time Gradient Descent and Discretization Error Analysiscited by 12

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2025: 1; 2026: 4.

5 papers.