Generalizing Adam to Manifolds for Efficiently Training Transformers
Not on the map. Why?
Abstract (arXiv)
One of the primary reasons behind the success of neural networks has been the emergence of an array of new, highly-successful optimizers, perhaps most importantly the Adam optimizer. It is widely used for training neural networks, yet notoriously hard to interpret. Lacking a clear physical intuition, Adam is difficult to generalize to manifolds. Some attempts have been made to directly apply parts of the Adam algorithm to manifolds or to find an underlying structure, but a full generalization has remained elusive. In this work a new approach is presented that leverages the special structure of the manifolds which are relevant for optimization of neural networks, such as the Stiefel manifold, the symplectic Stiefel manifold and the Grassmann manifold: all of these are homogeneous spaces and as such admit a global tangent space representation. This is a common vector space, often called the Lie subspace, that makes the generalization of all steps in the Adam optimizer (as well as other optimizers) possible. It is thus possible to extend the Adam optimizer to manifolds without a projection step, something that was not possible before. The resulting algorithm is then applied to train transformers and a symplectic autoencoder for which orthogonality constraints are enforced up to machine precision and we conclusively demonstrate the advantage of the proposed optimizer over existing methods.
Key facts. Cited by 3 papers in the map (data through 7 Oct 2026). Builds on 14 of its 67 references that are in the map. First posted on arXiv 26 May 2023.
Builds on
14 of 67 references.
References · 14
- 2017Attention Is All You Needcited by 59,932
- 2014Adam: A Method for Stochastic Optimizationcited by 36,960
- 2020An Image is Worth 16x16 Words: Transformers for Image Recognition at Scalecited by 29,915
- 2016Layer Normalizationcited by 5,579
- 2017Fashion-MNIST: a Novel Image Dataset for Benchmarking Machine Learning Algorithmscited by 4,283
- 2019Limitations of the Empirical Fisher Approximation for Natural Gradient Descentcited by 213
- 2018Riemannian Adaptive Optimization Methodscited by 187
- 2019Cheap Orthogonal Constraints in Neural Networks: A Simple Parametrization of the Orthogonal and Unitary Groupcited by 133
- 2020Efficient Riemannian Optimization on the Stiefel Manifold via the Cayley Transformcited by 79
- 2020A mathematical model for automatic differentiation in machine learningcited by 44
- 2018Autotune: A Derivative-free Optimization Framework for Hyperparameter Tuningcited by 20
- 2017Effective Extensible Programming: Unleashing Julia on GPUscited by 16
Built on by
Citing papers per year: 2023: 1; 2024: 1; 2025: 0; 2026: 1.
3 papers.
- 2026Natural gradient descent with momentum16 Apr 2026
- 2024Sparks of Quantum Advantage and Rapid Retraining in Machine Learning22 Jul 2024
- 2023Symplectic Autoencoders for Model Reduction of Hamiltonian Systems15 Dec 2023