SHANG++: Robust Stochastic Acceleration under Multiplicative Noise
Not on the map. Why?
Abstract (arXiv)
Under the multiplicative noise scaling (MNS) condition, original Nesterov acceleration is provably sensitive to noise and may diverge when gradient noise overwhelms the signal. In this paper, we develop two accelerated stochastic gradient descent methods by discretizing the Hessian-driven Nesterov accelerated gradient flow. We first derive SHANG, a direct semi-implicit discretization that already improves stability under MNS. We then introduce SHANG++, which adds a damping correction and achieves faster convergence with greater noise robustness. We establish convergence guarantees for both convex and strongly convex objectives under MNS, together with explicit parameter choices. In our experiments, SHANG++ performs consistently well across convex problems and applications in deep learning. In a dedicated noise experiment on ResNet-34, a single hyperparameter configuration maintains accuracy within one percentage point of the noise-free setting. Across all experiments, SHANG++ outperforms existing accelerated methods in robustness and efficiency, with minimal parameter sensitivity.
Key facts. Cited by 2 papers in the map (data through 7 Oct 2026). Builds on 20 of its 39 references that are in the map. First posted on arXiv 10 Mar 2026.
Builds on
20 of 39 references.
References · 20
- 2015Deep Residual Learning for Image Recognitioncited by 51,809
- 2014Adam: A Method for Stochastic Optimizationcited by 36,960
- 2015U-Net: Convolutional Networks for Biomedical Image Segmentationcited by 19,604
- 2019On Mixup Training: Improved Calibration and Predictive Uncertainty for Deep Neural Networkscited by 304
- 2018Fast and Faster Convergence of SGD for Over-Parameterized Models and an Accelerated Perceptroncited by 143
- 2014Analysis and Design of Optimization Algorithms via Integral Quadratic Constraintscited by 105
- 2022The alignment property of SGD noise and how it helps select flat minima: A stability analysiscited by 64
- 2018On the insufficiency of existing momentum schemes for Stochastic Optimizationcited by 46
- 2019Global Convergence of Adaptive Gradient Methods for An Over-parameterized Neural Networkcited by 27
- 2020On the Convergence of Nesterov's Accelerated Gradient Method in Stochastic Settingscited by 27
- 2020Multiplicative noise and heavy tails in stochastic optimizationcited by 15
- 2021A Continuized View on Nesterov Acceleration for Stochastic Gradient Descent and Randomized Gossipcited by 15
8 more
- 2019Nesterov's method with decreasing learning rate leads to accelerated stochastic gradient descentcited by 13
- 2022On the fast convergence of minibatch heavy ball momentumcited by 11
- 2023Provable non-accelerations of the heavy-ball methodcited by 11
- 2023Nesterov acceleration despite very noisy gradientscited by 7
- 2019First order optimization methods based on Hessian-driven Nesterov accelerated gradient flowcited by 6
- 2021A Unified Convergence Analysis of First Order Convex Optimization Methods via Strong Lyapunov Functionscited by 5
- 2018A Diffusion Approximation Theory of Momentum SGD in Nonconvex Optimizationcited by 2
- 2024Gradient correlation is a key ingredient to accelerate SGD with momentumcited by 2
Built on by
Citing papers per year: 2026: 2.
2 papers.