On Underdamped Nesterov's Acceleration
Not on the map. Why?
Abstract (arXiv)
The high-resolution differential equation framework has been proven to be tailor-made for Nesterov's accelerated gradient descent method~(textttNAG) and its proximal correspondence -- the class of faster iterative shrinkage thresholding algorithms (FISTA). However, the systems of theories is not still complete, since the underdamped case (r < 2) has not been included. In this paper, based on the high-resolution differential equation framework, we construct the new Lyapunov functions for the underdamped case, which is motivated by the power of the time tγ or the iteration kγ in the mixed term. When the momentum parameter r is 2, the new Lyapunov functions are identical to the previous ones. These new proofs do not only include the convergence rate of the objective value previously obtained according to the low-resolution differential equation framework but also characterize the convergence rate of the minimal gradient norm square. All the convergence rates obtained for the underdamped case are continuously dependent on the parameter r. In addition, it is observed that the high-resolution differential equation approximately simulates the convergence behavior of~textttNAG for the critical case r=-1, while the low-resolution differential equation degenerates to the conservative Newton's equation. The high-resolution differential equation framework also theoretically characterizes the convergence rates, which are consistent with that obtained for the underdamped case with r=-1.
Key facts. Cited by 1 paper in the map (data through 7 Oct 2026). Builds on 15 of its 26 references that are in the map. First posted on arXiv 28 Apr 2023.
Builds on
15 of 26 references.
References · 15
- 2014Adam: A Method for Stochastic Optimizationcited by 36,960
- 2015A Differential Equation for Modeling Nesterov's Accelerated Gradient Method: Theory and Insightscited by 203
- 2016A Variational Perspective on Accelerated Methods in Optimizationcited by 108
- 2013Accelerated Gradient Methods for Nonconvex Nonlinear and Stochastic Programmingcited by 74
- 2018Understanding the Acceleration Phenomenon via High-Resolution Differential Equationscited by 68
- 2019A Dynamical Systems Perspective on Nesterov Accelerationcited by 33
- 2020On Learning Rates and Schr"odinger Operatorscited by 33
- 2020Optimization with Momentum: Dynamical, Control-Theoretic, and Symplectic Perspectivescited by 27
- 2015The rate of convergence of Nesterov's accelerated forward-backward method is actually faster than 1/k2cited by 15
- 2020First-Order Methods for Nonconvex Quadratic Minimizationcited by 10
- 2017Rate of convergence of the Nesterov accelerated gradient method in the subcritical case α ≤ 3cited by 9
- 2021On the Hyperparameters in Stochastic Gradient Descent with Momentumcited by 9
Built on by
Citing papers per year: 2024: 1.
1 paper.