Adaptive Momentum and Nonlinear Damping for Neural Network Training
Not on the map. Why?
Abstract (arXiv)
Momentum Stochastic Gradient Descent (mSGD) relies on a fixed momentum coefficient shared across all parameters, failing to account for the heterogeneous structure of modern loss landscapes. In this work, we adopt a continuous-time formulation to introduce individual, adaptive momentum coefficients regulated by the kinetic energy of each model parameter. This mechanism automatically adjusts to evolving training dynamics to maintain stability without sacrificing convergence speed. We demonstrate that this adaptive friction is inextricably linked to cubic damping, a suppression mechanism from structural dynamics. We additionally introduce two optimization schemes by augmenting the continuous dynamics of mSGD and Adam with a cubic damping term. Empirically, our methods demonstrate robustness and match or outperform Adam on training ViT, BERT, and GPT2 tasks where mSGD typically struggles. We further provide theoretical results establishing the exponential convergence of the proposed schemes.
Key facts. Cited by 3 papers in the map (data through 7 Oct 2026). Builds on 17 of its 38 references that are in the map. First posted on arXiv 30 Jan 2026.
Builds on
17 of 38 references.
References · 17
- 2018GLUE: A Multi-Task Benchmark and Analysis Platform for Natural Language Understandingcited by 4,854
- 2017Visualizing the Loss Landscape of Neural Netscited by 1,126
- 2014The Loss Surfaces of Multilayer Networkscited by 278
- 2022TinyViT: Fast Pretraining Distillation for Small Vision Transformerscited by 232
- 2015A Differential Equation for Modeling Nesterov's Accelerated Gradient Method: Theory and Insightscited by 203
- 2024Why Transformers Need Adam: A Hessian Perspectivecited by 123
- 2023Noise Is Not the Main Factor Behind the Gap Between SGD and Adam on Transformers, but Sign Descent Might Becited by 114
- 2019On Empirical Comparisons of Optimizers for Deep Learningcited by 99
- 2025Small Batch Size Training for Language Models: When Vanilla SGD Works, and Why Gradient Accumulation Is Wastefulcited by 36
- 2020Fractional Underdamped Langevin Dynamics: Retargeting SGD with Momentum under Heavy-Tailed Gradient Noisecited by 33
- 2018Global Convergence of Stochastic Gradient Hamiltonian Monte Carlo for Non-Convex Stochastic Optimization: Non-Asymptotic Performance Bounds and Momentum-Based Accelerationcited by 31
- 2018A general system of differential equations to model first order adaptive algorithmscited by 28
5 more
- 2020The connections between Lyapunov functions for some optimization algorithms and differential equationscited by 11
- 2015Covariance-Controlled Adaptive Langevin Thermostat for Large-Scale Bayesian Samplingcited by 10
- 2023Friction-adaptive descent: a family of dynamics-based optimization methodscited by 5
- 2025Randomised Splitting Methods and Stochastic Gradient Descentcited by 3
- 2023On the connections between optimization algorithms, Lyapunov functions, and differential equations: theory and insightscited by 2
Built on by
Citing papers per year: 2026: 3.
3 papers.
- 2026Critical Damping as a Momentum Schedule: Multi-Seed Validation, a Hybrid Recipe, and an Exhaustive Negative Result on Surgical Layer Selectioncited by 0
- 2026Accelerated sampling using SamAdams variable timesteps and position-adaptive Langevin dynamicscited by 0
- 2026Low-Rank Friction for Memory-Efficient Transformer Pretrainingcited by 0
- 2026Low-Rank Friction for Memory-Efficient Transformer Pretraining24 Sep 2026
- 2026Accelerated sampling using SamAdams variable timesteps and position-adaptive Langevin dynamics25 Jun 2026
- 2026Critical Damping as a Momentum Schedule: Multi-Seed Validation, a Hybrid Recipe, and an Exhaustive Negative Result on Surgical Layer Selection30 Mar 2026