Rethinking the Variational Interpretation of Accelerated Optimization Methods
Peiyuan Zhang, Antonio Orvieto, Hadi Daneshmand
Abstract
The continuous-time model of Nesterov's momentum provides a thought-provoking perspective for understanding the nature of the acceleration phenomenon in convex optimization. One of the main ideas in this line of research comes from the field of classical mechanics and proposes to link Nesterov's trajectory to the solution of a set of Euler-Lagrange equations relative to the so-called Bregman Lagrangian. In the last years, this approach led to the discovery of many new (stochastic) accelerated algorithms and provided a solid theoretical foundation for the design of structure-preserving accelerated methods. In this work, we revisit this idea and provide an in-depth analysis of the action relative to the Bregman Lagrangian from the point of view of calculus of variations. Our main finding is that, while Nesterov's method is a stationary point for the action, it is often not a minimizer but instead a saddle point for this functional in the space of differentiable curves. This finding challenges the main intuition behind the variational interpretation of Nesterov's method and provides additional insights into the intriguing geometry of accelerated paths. * Equal Contribution. 2 A differentiable function f : R d → R is said to be β-smooth if it has β-Lipschitz gradients. 3 This lower bound holds just for k < d hence it is only interesting in the high-dimensional setting. 35th Conference on Neural Information Processing Systems (NeurIPS 2021).
Ask about this paper
Your agent reads all of it.
Lune indexed this paper to the last equation, along with the top-tier papers that cite it. Ask a question and the answer quotes them.
Your agent calls
Luneget_paper_fulltext
Free to start. No credit card required.
Terminal
Install the CLIlune papers fulltext 1153020a-3465-4177-9588-50263f625fbeCited by top-tier papers3
- Continuous-Time Analysis of Accelerated Gradient Methods via Conservation Laws in Dilated Coordinate SystemsJaewook J. Suh, Gyumin Roh, Ernest K. RyuICML 2022 · 16 citations
- Optimization Algorithm Design via Electric CircuitsStephen P. Boyd, Tetiana Parshakova, Ernest K. Ryu, Jaewook J. SuhNeurIPS 2024 · 14 citations
- A Variational Perspective on High-Resolution ODEsHoomaan Maskan, Konstantinos Zygalakis, Alp YurtseverNeurIPS 2023 · 5 citations
Builds on1
Related papers
- Unifying Nesterov's Accelerated Gradient Methods for Convex and Strongly Convex Objective FunctionsJungbin Kim, Insoon YangICML 2023 · 10 citations
- Conformal Symplectic and Relativistic OptimizationGuilherme França, Jeremias Sulam, Daniel P. Robinson, René VidalNeurIPS 2020 · 81 citations
- Accelerated Gradient Methods for Geodesically Convex Optimization: Tractable Algorithms and Convergence AnalysisJungbin Kim, Insoon YangICML 2022 · 26 citations
- Convex and Non-convex Optimization Under Generalized SmoothnessHaochuan Li, Jian Qian, Yi Tian, Alexander Rakhlin et al.NeurIPS 2023 · 93 citations
- On the Provable Suboptimality of Momentum SGD in Nonstationary Stochastic OptimizationSharan Sahu, Cameron Hogan, Martin WellsICML 2026 · 1 citation
