Towards Understanding Momentum Acceleration in River-Valley Loss Landscape
cs.LG, math.OC
Submitted: 2026-09-25
Updated: 2026-09-25
Comments: 70 pages, 15 figures
License: http://creativecommons.org/licenses/by/4.0/
The gist: The empirical success of pretraining large language models has inspired a deeper investigation into the underlying loss landscapes and the optimization dynamics.
Terminology
Abstract
The empirical success of pretraining large language models has inspired a deeper investigation into the underlying loss landscapes and the optimization dynamics. Recent empirical and theoretical study suggest that the training loss landscape often exhibits a "river-valley" structure, which features a low-loss manifold (river) flanked by sharp orthogonal directions with higher loss (mountains). In the long term, the optimization progress is determined primarily by the progress along the river. Within such a landscape, gradient descent with large learning rates can move faster along the river despite high apparent loss due to vertical oscillations, while a subsequent sharp decay in the learning rate suppresses these oscillations, revealing genuine optimization progress. This explains the recent success of warmup-stable-decay (WSD) learning rate scheduler which, unlike cosine scheduling, keeps stable high learning rate and decays before producing intermediate checkpoints. Building on this foundation, in this work we take a step further and study the role of momentum within such a loss landscape. We establish theoretical analysis that characterizes how momentum accelerates optimization by stabilizing large learning rates that can not be tolerated by vanilla GD without deviating significantly from the river. The enabled large learning rate in-turn gives greater speed along the river and makes faster essential progress in the long run. Another intriguing observation from theory is that for a river-valley landscape with very flat and slow-spinning river, the momentum itself does not contribute directly to acceleration in terms of the speed of tracking the river, while the main acceleration comes from the admissible larger learning rate.
Sources
- Momentum Further Constrains Sharpness at the Edge of Stochastic Stability
- Gradient Descent on Neural Networks Typically Occurs at the Edge of Stability
- Gradient descent with adaptive stepsize converges (nearly) linearly under fourth-order growth
- TinyStories: How Small Can Language Models Be and Still Speak Coherent English?
- When and Why Momentum Accelerates SGD:An Empirical Study
- The Pile: An 800GB Dataset of Diverse Text for Language Modeling
- Accurate, Large Minibatch SGD: Training ImageNet in 1 Hour
- Polyak's Heavy Ball Method Achieves Accelerated Local Rate of Convergence under Polyak-Lojasiewicz Inequality
- Adam: A Method for Stochastic Optimization
- Beyond the Quadratic Approximation: the Multiscale Structure of Neural Network Loss Landscapes
- Gradient Descent on Logistic Regression with Non-Separable Data and Large Step Sizes
- The AdEMAMix Optimizer: Better, Faster, Older
- Accelerated Over-Relaxation Heavy-Ball Method: Achieving Global Accelerated Convergence with Broad Generalization
- A Walk with SGD
- The Implicit Bias of Heterogeneity towards Invariance: A Study of Multi-Environment Matrix Sensing
- Minimax Optimal Convergence of Gradient Descent in Logistic Regression via Large and Adaptive Stepsizes
Related papers
- Polynomial-Augmented Neural Networks (PANNs) with Weak Orthogonality Constraints for Enhanced Function and PDE Approximation
- AIRL-S: Unifying Reinforcement Learning and Search-Based Test-Time Scaling via Adversarial Inverse Reinforcement Learning
- Transformers as Bayesian In-Context Experimenters: Smoothness-Adaptive Efficient ATE Estimation
- Convergence issues in Relational Concept Analysis based on AOC-posets
- Beliefs Beyond Posteriors: The Predictive Cost of ELBO Binding
- Understanding Diffusion Models via Ratio-Based Function Approximation with SignReLU Networks