mlsanityData to 14 Oct 2026

Adaptive Methods through the Lens of SDEs: Theoretical Insights on the Role of Noise

arXiv 2411.15958 ↗First posted 24 Nov 2024cs.LGcited by 23

Not on the map. Why?

Abstract (arXiv)

Despite the vast empirical evidence supporting the efficacy of adaptive optimization methods in deep learning, their theoretical understanding is far from complete. This work introduces novel SDEs for commonly used adaptive optimizers: SignSGD, RMSprop(W), and Adam(W). These SDEs offer a quantitatively accurate description of these optimizers and help illuminate an intricate relationship between adaptivity, gradient noise, and curvature. Our novel analysis of SignSGD highlights a noteworthy and precise contrast to SGD in terms of convergence speed, stationary distribution, and robustness to heavy-tail noise. We extend this analysis to AdamW and RMSpropW, for which we observe that the role of noise is much more complex. Crucially, we support our theoretical analysis with experimental evidence by verifying our insights: this includes numerically integrating our SDEs using Euler-Maruyama discretization on various neural network architectures such as MLPs, CNNs, ResNets, and Transformers. Our SDEs accurately track the behavior of the respective optimizers, especially when compared to previous SDEs derived for Adam and RMSprop. We believe our approach can provide valuable insights into best training practices and novel scaling rules.

Key facts. Cited by 23 papers in the map (data through 14 Oct 2026). First posted on arXiv 24 Nov 2024.

Builds on

0 of 0 references.

No references here yet.

Built on by

Cited by year (2026 to 14 Oct)

Citing papers per year: 2025: 11; 2026: 12.

23 papers.

Sort:

By area:

  1. 2025In Search of Adam's Secret Saucecited by 40
  2. 2025Completed Hyperparameter Transfer across Modules, Width, Depth, Batch and Durationcited by 27
  3. 2025Scaling Laws for Gradient Descent and Sign Descent for Linear Bigram Models under Zipf's Lawcited by 24
  4. 2025Is your batch size the problem? Revisiting the Adam-SGD gap in language modelingcited by 15
  5. 2026A Defense of the Quadratic Modelcited by 14
  6. 2025Sign Operator for Coping with Heavy-Tailed Noise in Non-Convex Optimization: High Probability Bounds Under (L0, L1)-Smoothnesscited by 13
  7. 2026Deriving Hyperparameter Scaling Laws via Modern Optimization Theorycited by 10
  8. 2025Optimal Scaling Needs Optimal Normcited by 8
  9. 2026On the Role of Batch Size in Stochastic Conditional Gradient Methodscited by 7
  10. 2025How Memory in Optimization Algorithms Implicitly Modifies the Losscited by 6
  11. 2025Seesaw: Accelerating Training by Balancing Learning Rate and Batch Size Schedulingcited by 6
  12. 2025Unbiased and Sign Compression in Distributed Learning: Comparing Noise Resilience via SDEscited by 5
11 more
  1. 2026The Effect of Mini-Batch Noise on the Implicit Bias of Adamcited by 4
  2. 2025Continuous-Time Analysis of Heavy Ball Momentum in Min-Max Gamescited by 3
  3. 2025Per-example gradients: a new frontier for understanding and improving optimizerscited by 2
  4. 2026Adaptive Methods Are Preferable in High Privacy Settings: An SDE Perspectivecited by 2
  5. 2026On Interpolation Formulas Describing Neural Network Generalizationcited by 1
  6. 2026Beyond a Single Explanation of the Adam--SGD Gapcited by 1
  7. 2026CoScale-RL: Efficient Post-Training by Co-Scaling Data and Computationcited by 0
  8. 2026Understanding Dynamics of Adam in Zero-Sum Games: An ODE Approachcited by 0
  9. 2026A Diffusion Approximation for Temporal-Difference Learning with Linear Features under Markovian Noisecited by 0
  10. 2026Muon Under Gradient Noise and the Limits of Orthogonalization Near Optimacited by 0
  11. 2026The Best Optimizer Depends on Batch Sizecited by 0