Dynamic Momentum Recalibration in Online Gradient Learning
Not on the map. Why?
Abstract (arXiv)
Stochastic Gradient Descent (SGD) and its momentum variants form the backbone of deep learning optimization, yet the underlying dynamics of their gradient behavior remain insufficiently understood. In this work, we reinterpret gradient updates through the lens of signal processing and reveal that fixed momentum coefficients inherently distort the balance between bias and variance, leading to skewed or suboptimal parameter updates. To address this, we propose SGDF (SGD with Filter), an optimizer inspired by the principles of Optimal Linear Filtering. SGDF computes an online, time-varying gain to dynamically refine gradient estimation by minimizing the mean-squared error, thereby achieving an optimal trade-off between noise suppression and signal preservation. Furthermore, our approach could extend to other optimizers, showcasing its broad applicability to optimization frameworks. Extensive experiments across diverse architectures and benchmarks demonstrate SGDF surpasses conventional momentum methods and achieves performance on par with or surpassing state-of-the-art optimizers.
Key facts. Cited by 1 paper in the map (data through 7 Oct 2026). Builds on 59 of its 87 references that are in the map. First posted on arXiv 6 Mar 2026.
Builds on
59 of 87 references.
References · 59
- 2015Deep Residual Learning for Image Recognitioncited by 51,809
- 2020An Image is Worth 16x16 Words: Transformers for Image Recognition at Scalecited by 29,915
- 2014Microsoft COCO: Common Objects in Contextcited by 17,498
- 2014Very Deep Convolutional Networks for Large-Scale Image Recognitioncited by 15,267
- 2015Faster R-CNN: Towards Real-Time Object Detection with Region Proposal Networkscited by 9,617
- 2016Densely Connected Convolutional Networkscited by 6,691
- 2022Scalable Diffusion Models with Transformerscited by 5,931
- 2016Improved Techniques for Training GANscited by 2,938
- 2020Sharpness-Aware Minimization for Efficiently Improving Generalizationcited by 1,404
- 2016On Large-Batch Training for Deep Learning: Generalization Gap and Sharp Minimacited by 1,337
- 2016Optimization Methods for Large-Scale Machine Learningcited by 1,140
- 2017Visualizing the Loss Landscape of Neural Netscited by 1,126
38 more
- 2016An overview of gradient descent optimization algorithmscited by 1,021
- 2019On the Convergence of Adam and Beyondcited by 834
- 2019On the Variance of the Adaptive Learning Rate and Beyondcited by 763
- 2024SiT: Exploring Flow and Diffusion-based Generative Models with Scalable Interpolant Transformerscited by 707
- 2018signSGD: Compressed Optimisation for Non-Convex Problemscited by 561
- 2015Train faster, generalize better: Stability of stochastic gradient descentcited by 547
- 2023Symbolic Discovery of Optimization Algorithmscited by 423
- 2014SAGA: A Fast Incremental Gradient Method With Support for Non-Strongly Convex Composite Objectivescited by 401
- 2017Stochastic Gradient Descent as Approximate Bayesian Inferencecited by 298
- 2019PyHessian: Neural Networks Through the Lens of the Hessiancited by 291
- 2014Identifying and attacking the saddle point problem in high-dimensional non-convex optimizationcited by 286
- 2020AdaBelief Optimizer: Adapting Stepsizes by the Belief in Observed Gradientscited by 282
- 2023Sophia: A Scalable Stochastic Second-order Optimizer for Language Model Pre-trainingcited by 260
- 2017The Marginal Value of Adaptive Gradient Methods in Machine Learningcited by 248
- 2020ADAHESSIAN: An Adaptive Second Order Optimizer for Machine Learningcited by 201
- 2019Adaptive Gradient Methods with Dynamic Bound of Learning Ratecited by 181
- 2018On the Convergence of A Class of Adam-Type Algorithms for Non-Convex Optimizationcited by 173
- 2022Surrogate Gap Minimization Improves Sharpness-Aware Trainingcited by 171
- 2013Minimizing Finite Sums with the Stochastic Average Gradientcited by 164
- 2016Variance-based regularization with convex objectivescited by 153
- 2017Dissecting Adam: The Sign, Magnitude and Variance of Stochastic Gradientscited by 136
- 2020Momentum Improves Normalized SGDcited by 136
- 2024Adam-mini: Use Fewer Learning Rates To Gain Morecited by 134
- 2017Improving Generalization Performance by Switching from Adam to SGDcited by 121
- 2023Noise Is Not the Main Factor Behind the Gap Between SGD and Adam on Transformers, but Sign Descent Might Becited by 114
- 2018Stochastic Modified Equations and Dynamics of Stochastic Gradient Algorithms I: Mathematical Foundationscited by 109
- 2018On the Power of Over-parametrization in Neural Networks with Quadratic Activationcited by 102
- 2018Closing the Generalization Gap of Adaptive Gradient Methods in Training Deep Neural Networkscited by 89
- 2018Hessian-based Analysis of Large Batch Training and Robustness to Adversariescited by 87
- 2023Gradient Norm Aware Minimization Seeks First-Order Flatness and Improves Generalizationcited by 57
- 2018Quasi-hyperbolic momentum and Adam for deep learningcited by 47
- 2020On the distance between two neural networks and the stability of learningcited by 46
- 2020Adaptive Inertia: Disentangling the Effects of Adaptive Learning Rate and Momentumcited by 40
- 2023Closing the Gap Between the Upper Bound and the Lower Bound of Adam's Iteration Complexitycited by 38
- 2024Grokfast: Accelerated Grokking by Amplifying Slow Gradientscited by 38
- 2020The Two Regimes of Deep Network Trainingcited by 30
- 2022Stochastic gradient descent introduces an effective landscape-dependent regularization favoring flat solutionscited by 22
- 2017YellowFin and the Art of Momentum Tuningcited by 16
50 most cited of 59 All 59 (JSON)
Built on by
Citing papers per year: 2026: 1.
1 paper.
- 2026VCMM: Variance-Calibrated Momentum for Multimodal Learning23 Sep 2026