Riemannian Lyapunov Optimizer: A Unified Framework for Optimization
Not on the map. Why?
Abstract (arXiv)
We introduce Riemannian Lyapunov Optimizers (RLOs), a family of optimization algorithms that unifies classic optimizers within one geometric framework. Unlike heuristic improvements to existing optimizers, RLOs are systematically derived from a novel control-theoretic framework that reinterprets optimization as an extended state discrete-time controlled dynamical system on a Riemannian parameter manifold. Central to this framework is the identification of a Normally Attracting Invariant Manifold (NAIM), which organizes training dynamics into two distinct stages: rapid alignment of the speed state to a target graph, followed by controlled evolution within it. We formalize this by constructing a strict Lyapunov function that certifies convergence to a target manifold. This perspective yields a constructive ``optimizer generator" that not only recovers classic algorithms but enables the principled design of RLOs. We validate our theory via geometric diagnostics and demonstrate that grounding optimizer design in control theory yields state-of-the-art performance in large-scale benchmarks. Overall, RLOs bridge control theory and modern machine learning optimization, providing a unified language and a systematic toolkit for designing stable, effective optimizers.
Key facts. No citing papers in the map yet (data through 7 Oct 2026). Builds on 21 of its 32 references that are in the map. First posted on arXiv 29 Jan 2026.
Builds on
21 of 32 references.
References · 21
- 2015Deep Residual Learning for Image Recognitioncited by 51,809
- 2014Adam: A Method for Stochastic Optimizationcited by 36,960
- 2020An Image is Worth 16x16 Words: Transformers for Image Recognition at Scalecited by 29,915
- 2014ImageNet Large Scale Visual Recognition Challengecited by 8,441
- 2020Training data-efficient image transformers & distillation through attentioncited by 4,560
- 2016On Large-Batch Training for Deep Learning: Generalization Gap and Sharp Minimacited by 1,337
- 2016Optimization Methods for Large-Scale Machine Learningcited by 1,140
- 2017Visualizing the Loss Landscape of Neural Netscited by 1,126
- 2018Adafactor: Adaptive Learning Rates with Sublinear Memory Costcited by 896
- 2019On the Convergence of Adam and Beyondcited by 834
- 2018signSGD: Compressed Optimisation for Non-Convex Problemscited by 561
- 2023Symbolic Discovery of Optimization Algorithmscited by 423
9 more
- 2018Shampoo: Preconditioned Stochastic Tensor Optimizationcited by 413
- 2016Entropy-SGD: Biasing Gradient Descent Into Wide Valleyscited by 357
- 2019Error Feedback Fixes SignSGD and other Gradient Compression Schemescited by 306
- 2023Sophia: A Scalable Stochastic Second-order Optimizer for Language Model Pre-trainingcited by 260
- 2015A Differential Equation for Modeling Nesterov's Accelerated Gradient Method: Theory and Insightscited by 203
- 2020ADAHESSIAN: An Adaptive Second Order Optimizer for Machine Learningcited by 201
- 2016A Variational Perspective on Accelerated Methods in Optimizationcited by 108
- 2018Closing the Generalization Gap of Adaptive Gradient Methods in Training Deep Neural Networkscited by 89
- 2016Nesterov's Accelerated Gradient and Momentum as approximations to Regularised Update Descentcited by 26
Built on by
Not cited yet.