mlsanityData to 7 Oct 2026

A Continuized View on Nesterov Acceleration for Stochastic Gradient Descent and Randomized Gossip

arXiv 2106.07644 ↗First posted 10 Jun 2021math.OC cs.LG cs.MAcited by 15

Not on the map. Why?

Abstract (arXiv)

We introduce the continuized Nesterov acceleration, a close variant of Nesterov acceleration whose variables are indexed by a continuous time parameter. The two variables continuously mix following a linear ordinary differential equation and take gradient steps at random times. This continuized variant benefits from the best of the continuous and the discrete frameworks: as a continuous process, one can use differential calculus to analyze convergence and obtain analytical expressions for the parameters; and a discretization of the continuized process can be computed exactly with convergence rates similar to those of Nesterov original acceleration. We show that the discretization has the same structure as Nesterov acceleration, but with random parameters. We provide continuized Nesterov acceleration under deterministic as well as stochastic gradients, with either additive or multiplicative noise. Finally, using our continuized framework and expressing the gossip averaging problem as the stochastic minimization of a certain energy function, we provide the first rigorous acceleration of asynchronous gossip algorithms.

Key facts. Cited by 15 papers in the map (data through 7 Oct 2026). Builds on 29 of its 62 references that are in the map. First posted on arXiv 10 Jun 2021.

Builds on

29 of 62 references.

References · 29

  1. 2016Optimization Methods for Large-Scale Machine Learningcited by 1,140
  2. 2015Coordinate Descent Algorithmscited by 218
  3. 2015A Differential Equation for Modeling Nesterov's Accelerated Gradient Method: Theory and Insightscited by 203
  4. 2018Fast and Faster Convergence of SGD for Over-Parameterized Models and an Accelerated Perceptroncited by 143
  5. 2016A Variational Perspective on Accelerated Methods in Optimizationcited by 108
  6. 2017Optimal algorithms for smooth and strongly convex distributed optimization in networkscited by 81
  7. 2018Understanding the Acceleration Phenomenon via High-Resolution Differential Equationscited by 68
  8. 2014Linear Coupling: An Ultimate Unification of Gradient and Mirror Descentcited by 58
  9. 2021Acceleration Methodscited by 48
  10. 2020Tight Nonparametric Convergence Rates for Stochastic Gradient Descent under the Noiseless Linear Modelcited by 39
  11. 2019A Dynamical Systems Perspective on Nesterov Accelerationcited by 33
  12. 2016A Lyapunov Analysis of Momentum Methods in Optimizationcited by 28
17 more
  1. 2017The Approximate Duality Gap Technique: A Unified Theory of First-Order Methodscited by 27
  2. 2019Acceleration via Symplectic Discretization of High-Resolution Differential Equationscited by 27
  3. 2015From Averaging to Acceleration, There is Only a Step-sizecited by 24
  4. 2020Analysis of Stochastic Gradient Descent in Continuous Timecited by 24
  5. 2015A geometric alternative to Nesterov's accelerated gradient descentcited by 21
  6. 2018Direct Runge-Kutta Discretization Achieves Accelerationcited by 21
  7. 2018On Acceleration with Noise-Corrupted Gradientscited by 20
  8. 2014Optimized first-order methods for smooth convex minimizationcited by 18
  9. 2018Accelerated Gossip in Networks of Given Dimension using Jacobi Polynomial Iterationscited by 15
  10. 2018Robust Accelerated Gradient Methods for Smooth Strongly Convex Functionscited by 12
  11. 2018Accelerated Decentralized Optimization with Local Updates for Smooth and Strongly Convex Objectivescited by 11
  12. 2020The connections between Lyapunov functions for some optimization algorithms and differential equationscited by 11
  13. 2019An Accelerated Decentralized Stochastic Proximal Algorithm for Finite Sumscited by 10
  14. 2017Rate of convergence of the Nesterov accelerated gradient method in the subcritical case α ≤ 3cited by 9
  15. 2019Accelerated First-Order Methods: Differential Equations and Lyapunov Functionscited by 5
  16. 2020Asynchrony and Acceleration in Gossip Algorithmscited by 5
  17. 2018Provably Accelerated Randomized Gossip Algorithmscited by 3

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2022: 3; 2023: 2; 2024: 5; 2025: 3; 2026: 2.

15 papers.

Sort: