mlsanityData to 14 Oct 2026

Quantitative Convergences of Lie Group Momentum Optimizers

arXiv 2405.20390 ↗First posted 30 May 2024cs.LG cs.NA math.NAcited by 1

Not on the map. Why?

Abstract (arXiv)

Explicit, momentum-based dynamics that optimize functions defined on Lie groups can be constructed via variational optimization and momentum trivialization. Structure preserving time discretizations can then turn this dynamics into optimization algorithms. This article investigates two types of discretization, Lie Heavy-Ball, which is a known splitting scheme, and Lie NAG-SC, which is newly proposed. Their convergence rates are explicitly quantified under L-smoothness and local strong convexity assumptions. Lie NAG-SC provides acceleration over the momentumless case, i.e. Riemannian gradient descent, but Lie Heavy-Ball does not. When compared to existing accelerated optimizers for general manifolds, both Lie Heavy-Ball and Lie NAG-SC are computationally cheaper and easier to implement, thanks to their utilization of group structure. Only gradient oracle and exponential map are required, but not logarithm map or parallel transport which are computational costly.

Key facts. Cited by 1 paper in the map (data through 14 Oct 2026). Builds on 18 of its 34 references that are in the map. First posted on arXiv 30 May 2024.

Builds on

18 of 34 references.

References · 18

  1. 2017Attention Is All You Needcited by 60,361
  2. 2020An Image is Worth 16x16 Words: Transformers for Image Recognition at Scalecited by 30,186
  3. 2015Unitary Evolution Recurrent Neural Networkscited by 294
  4. 2017Parseval Networks: Improving Robustness to Adversarial Examplescited by 293
  5. 2023Controlling Text-to-Image Diffusion by Orthogonal Finetuningcited by 208
  6. 2016A Variational Perspective on Accelerated Methods in Optimizationcited by 110
  7. 2016First-order Methods for Geodesically Convex Optimizationcited by 93
  8. 2017Orthogonal Recurrent Neural Networks with Scaled Cayley Transformcited by 83
  9. 2018Understanding the Acceleration Phenomenon via High-Resolution Differential Equationscited by 69
  10. 2018Averaging Stochastic Gradient Descent on Riemannian Manifoldscited by 39
  11. 2019A Continuous-time Perspective for Modeling Acceleration in Riemannian Optimizationcited by 25
  12. 2020From Nesterov's Estimate Sequence to Riemannian Accelerationcited by 24
6 more
  1. 2020An accelerated first-order method for non-convex optimization on manifoldscited by 15
  2. 2018Towards Riemannian Accelerated Gradient Methodscited by 12
  3. 2020Variational Optimization on Lie Groups, with Examples of Leading (Generalized) Eigenvalue Problemscited by 12
  4. 2021Negative curvature obstructs acceleration for strongly geodesically convex optimization, even with exact first-order oraclescited by 12
  5. 2022Momentum Stiefel Optimizer, with Applications to Suitably-Orthogonal Attention, and Optimal Transportcited by 11
  6. 2024Convergence of Kinetic Langevin Monte Carlo on Lie groupscited by 6

Built on by

Cited by year

Citing papers per year: 2025: 1.

1 paper.