Grams: Gradient Descent with Adaptive Momentum Scaling
Not on the map. Why?
Abstract (arXiv)
We introduce Gradient Descent with Adaptive Momentum Scaling (Grams), a novel optimization algorithm that decouples the direction and magnitude of parameter updates in deep learning. Unlike traditional optimizers that directly integrate momentum into updates, Grams separates the update direction, derived from current gradients, from momentum, which is used solely for adaptive magnitude scaling. This approach enables Grams to achieve improved loss descent compared to state-of-the-art cautious and momentum-based optimizers. We theoretically demonstrate that Grams descents faster than other state-of-the-art optimizers and establish a global convergence guarantee for Grams. We also validate its effectiveness through extensive empirical evaluations. The results demonstrate Grams' superior performance, including faster convergence and better generalization, compared to widely-used optimizers such as Adam, Lion, and their cautious variants. Our results highlight Grams' potential as a transformative approach for efficiently training and fine-tuning large language models. Code is available at https://github.com/Gunale0926/Grams.
Key facts. Cited by 4 papers in the map (data through 14 Oct 2026). Builds on 35 of its 45 references that are in the map. First posted on arXiv 22 Dec 2024.
Builds on
35 of 45 references.
References · 35
- 2017Attention Is All You Needcited by 60,361
- 2021High-Resolution Image Synthesis with Latent Diffusion Modelscited by 18,863
- 2023GPT-4 Technical Reportcited by 18,396
- 2024The Llama 3 Herd of Modelscited by 14,715
- 2019Exploring the Limits of Transfer Learning with a Unified Text-to-Text Transformercited by 14,599
- 2023LLaMA: Open and Efficient Foundation Language Modelscited by 14,132
- 2019RoBERTa: A Robustly Optimized BERT Pretraining Approachcited by 13,372
- 2021Training Verifiers to Solve Math Word Problemscited by 10,109
- 2020Scaling Laws for Neural Language Modelscited by 6,586
- 2021Measuring Mathematical Problem Solving With the MATH Datasetcited by 5,371
- 2016Wide Residual Networkscited by 3,070
- 2020Sharpness-Aware Minimization for Efficiently Improving Generalizationcited by 1,417
23 more
- 2016An overview of gradient descent optimization algorithmscited by 1,033
- 2018Adafactor: Adaptive Learning Rates with Sublinear Memory Costcited by 905
- 2015Optimizing Neural Networks with Kronecker-factored Approximate Curvaturecited by 796
- 2023MetaMath: Bootstrap Your Own Mathematical Questions for Large Language Modelscited by 735
- 2018signSGD: Compressed Optimisation for Non-Convex Problemscited by 571
- 2024GaLore: Memory-Efficient LLM Training by Gradient Low-Rank Projectioncited by 463
- 2023Symbolic Discovery of Optimization Algorithmscited by 434
- 2018Shampoo: Preconditioned Stochastic Tensor Optimizationcited by 426
- 2020AdaBelief Optimizer: Adapting Stepsizes by the Belief in Observed Gradientscited by 283
- 2021When Vision Transformers Outperform ResNets without Pre-training or Strong Data Augmentationscited by 260
- 2024SOAP: Improving and Stabilizing Shampoo using Adamcited by 192
- 2022Adan: Adaptive Nesterov Momentum Algorithm for Faster Optimizing Deep Modelscited by 174
- 2024The Road Less Scheduledcited by 163
- 2015Adding Gradient Noise Improves Learning for Very Deep Networkscited by 145
- 2023Full Parameter Fine-tuning for Large Language Models with Limited Resourcescited by 134
- 2023Convergence of Adam Under Relaxed Assumptionscited by 99
- 2017Accelerated Gradient Descent Escapes Saddle Points Faster than Gradient Descentcited by 66
- 2024Cautious Optimizers: Improving Training with One Line of Codecited by 47
- 2016A Lyapunov Analysis of Momentum Methods in Optimizationcited by 28
- 2024ADOPT: Modified Adam Can Converge with Any β2 with the Optimal Ratecited by 18
- 2024Memory-Efficient Optimization with Factorized Hamiltonian Descentcited by 11
- 2023Variational Principles for Mirror Descent and Mirror Langevin Dynamicscited by 5
- 2024SORSA: Singular Values and Orthonormal Regularized Singular Vectors Adaptation of Large Language Modelscited by 5
Built on by
Citing papers per year: 2025: 3; 2026: 1.
4 papers.
- 2025High-Order Matching for One-Step Shortcut Diffusion Modelscited by 15
- 2025Video Latent Flow Matching: Optimal Polynomial Projections for Video Interpolation and Extrapolationcited by 11
- 2025ANO : Faster is Better in Noisy Landscapecited by 1
- 2026OmniOpt: Taxonomy, Geometry, and Benchmarking of Modern Optimizerscited by 0
- 2026OmniOpt: Taxonomy, Geometry, and Benchmarking of Modern Optimizers4 Jul 2026
- 2025ANO : Faster is Better in Noisy Landscape25 Aug 2025
- 2025High-Order Matching for One-Step Shortcut Diffusion Models2 Feb 2025
- 2025Video Latent Flow Matching: Optimal Polynomial Projections for Video Interpolation and Extrapolation1 Feb 2025