Backward error analysis and the qualitative behaviour of stochastic optimization algorithms: Application to stochastic coordinate descent
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
- 2016Optimization Methods for Large-Scale Machine Learningcited by 1,140
- 2019SGD: General Analysis and Improved Ratescited by 206
- 2021On the Origin of Implicit Regularization in Stochastic Gradient Descentcited by 183
- 2020Implicit Gradient Regularizationcited by 145
- 2018Stochastic Modified Equations and Dynamics of Stochastic Gradient Algorithms I: Mathematical Foundationscited by 109
- 2020Analysis of Stochastic Gradient Descent in Continuous Timecited by 24
- 2021On Riemannian Stochastic Approximation Schemes with Fixed Step-Sizecited by 12
- 2022Toward Equation of Motion for Deep Neural Networks: Continuous-time Gradient Descent and Discretization Error Analysiscited by 12
Built on by
Citing papers per year: 2025: 1; 2026: 4.
5 papers.
- 2025ODE approximation for the Adam algorithm: General and overparametrized settingcited by 8
- 2026Rod Flow: A Continuous-Time Model for Gradient Descent at the Edge of Stabilitycited by 6
- 2026Towards Universal Convergence of Backward Error in Linear System Solverscited by 1
- 2026Do Deep Networks Forget Initialization? A Forgetting-Time View of Practical Inductive Biascited by 0
- 2026Second-Order Path Kernel Interpolation Formulas in Machine Learningcited by 0
- 2026Second-Order Path Kernel Interpolation Formulas in Machine Learning5 Jun 2026
- 2026Do Deep Networks Forget Initialization? A Forgetting-Time View of Practical Inductive Bias27 May 2026
- 2026Towards Universal Convergence of Backward Error in Linear System Solvers17 Apr 2026
- 2026Rod Flow: A Continuous-Time Model for Gradient Descent at the Edge of Stability1 Feb 2026
- 2025ODE approximation for the Adam algorithm: General and overparametrized setting6 Nov 2025