Generalized Continuous-Time Models for Nesterov's Accelerated Gradient Methods
Not on the map. Why?
Abstract (arXiv)
Recent research has indicated a substantial rise in interest in understanding Nesterov's accelerated gradient methods via their continuous-time models. However, most existing studies focus on specific classes of Nesterov's methods, which hinders the attainment of an in-depth understanding and a unified perspective. To address this deficit, we present generalized continuous-time models that cover a broad range of Nesterov's methods, including those previously studied under existing continuous-time frameworks. Our key contributions are as follows. First, we identify the convergence rates of the generalized models, eliminating the need to determine the convergence rate for any specific continuous-time model derived from them. Second, we show that six existing continuous-time models are special cases of our generalized models, thereby positioning our framework as a unifying tool for analyzing and understanding these models. Third, we design a restart scheme for Nesterov's methods based on our generalized models and show that it ensures a monotonic decrease in objective function values. Owing to the broad applicability of our models, this scheme can be used to a broader class of Nesterov's methods compared to the original restart scheme. Fourth, we uncover a connection between our generalized models and gradient flow in continuous time, showing that the accelerated convergence rates of our generalized models can be attributed to a time reparametrization in gradient flow. Numerical experiment results are provided to support our theoretical analyses and results.
Key facts. No citing papers in the map yet (data through 7 Oct 2026). Builds on 34 of its 60 references that are in the map. First posted on arXiv 2 Sep 2024.
Builds on
34 of 60 references.
References · 34
- 2016Optimization Methods for Large-Scale Machine Learningcited by 1,140
- 2015A Differential Equation for Modeling Nesterov's Accelerated Gradient Method: Theory and Insightscited by 203
- 2022Adan: Adaptive Nesterov Momentum Algorithm for Faster Optimizing Deep Modelscited by 172
- 2016A Variational Perspective on Accelerated Methods in Optimizationcited by 108
- 2014Analysis and Design of Optimization Algorithms via Integral Quadratic Constraintscited by 105
- 2018Understanding the Acceleration Phenomenon via High-Resolution Differential Equationscited by 68
- 2014Linear Coupling: An Ultimate Unification of Gradient and Mirror Descentcited by 58
- 2021Acceleration Methodscited by 48
- 2015Smooth Strongly Convex Interpolation and Exact Worst-case Performance of First-order Methodscited by 36
- 2019A Dynamical Systems Perspective on Nesterov Accelerationcited by 33
- 2017The Approximate Duality Gap Technique: A Unified Theory of First-Order Methodscited by 27
- 2019Acceleration via Symplectic Discretization of High-Resolution Differential Equationscited by 27
22 more
- 2020Optimization with Momentum: Dynamical, Control-Theoretic, and Symplectic Perspectivescited by 27
- 2019A Continuous-time Perspective for Modeling Acceleration in Riemannian Optimizationcited by 25
- 2020On dissipative symplectic integration with applications to gradient-based optimizationcited by 23
- 2017Dissipativity Theory for Nesterov's Accelerated Methodcited by 22
- 2015A geometric alternative to Nesterov's accelerated gradient descentcited by 21
- 2018Direct Runge-Kutta Discretization Achieves Accelerationcited by 21
- 2017Analysis of Optimization Algorithms via Integral Quadratic Constraints: Nonstrongly Convex Problemscited by 19
- 2021A Continuized View on Nesterov Acceleration for Stochastic Gradient Descent and Randomized Gossipcited by 15
- 2016Fast convex optimization via inertial dynamics with Hessian driven dampingcited by 13
- 2020The connections between Lyapunov functions for some optimization algorithms and differential equationscited by 11
- 2020Federated Learning with Nesterov Accelerated Gradientcited by 11
- 2022Accelerated Gradient Methods for Geodesically Convex Optimization: Tractable Algorithms and Convergence Analysiscited by 10
- 2022Gradient Norm Minimization of Nesterov Acceleration: o(1/k3)cited by 8
- 2021A Unified Convergence Analysis of First Order Convex Optimization Methods via Strong Lyapunov Functionscited by 5
- 2022Revisiting the acceleration phenomenon via high-resolution differential equationscited by 5
- 2023Accelerated First-Order Optimization under Nonlinear Constraintscited by 5
- 2022Continuous-Time Analysis of Accelerated Gradient Methods via Conservation Laws in Dilated Coordinate Systemscited by 4
- 2022Nesterov Meets Optimism: Rate-Optimal Separable Minimax Optimizationcited by 2
- 2023A Variational Perspective on High-Resolution ODEscited by 2
- 2023Unifying Nesterov's Accelerated Gradient Methods for Convex and Strongly Convex Objective Functions: From Continuous-Time Dynamics to Discrete-Time Algorithmscited by 1
- 2023A speed restart scheme for a dynamics with Hessian driven dampingcited by 1
- 2024A unified Euler--Lagrange system for analyzing continuous-time accelerated gradient methodscited by 1
Built on by
Not cited yet.