mlsanityData to 7 Oct 2026

Resonance in Weight Space: Covariate Shift Can Drive Divergence of SGD with Momentum

arXiv 2203.11992 ↗First posted 22 Mar 2022cs.LG stat.MLcited by 1

Not on the map. Why?

Abstract (arXiv)

Most convergence guarantees for stochastic gradient descent with momentum (SGDm) rely on iid sampling. Yet, SGDm is often used outside this regime, in settings with temporally correlated input samples such as continual learning and reinforcement learning. Existing work has shown that SGDm with a decaying step-size can converge under Markovian temporal correlation. In this work, we show that SGDm under covariate shift with a fixed step-size can be unstable and diverge. In particular, we show SGDm under covariate shift is a parametric oscillator, and so can suffer from a phenomenon known as resonance. We approximate the learning system as a time varying system of ordinary differential equations, and leverage existing theory to characterize the system's divergence/convergence as resonant/nonresonant modes. The theoretical result is limited to the linear setting with periodic covariate shift, so we empirically supplement this result to show that resonance phenomena persist even under non-periodic covariate shift, nonlinear dynamics with neural networks, and optimizers other than SGDm.

Key facts. Cited by 1 paper in the map (data through 7 Oct 2026). Builds on 22 of its 45 references that are in the map. First posted on arXiv 22 Mar 2022.

Builds on

22 of 45 references.

References · 22

  1. 2014Adam: A Method for Stochastic Optimizationcited by 36,960
  2. 2019Implicit Regularization in Deep Matrix Factorizationcited by 402
  3. 2019The Non-IID Data Quagmire of Decentralized Machine Learningcited by 303
  4. 2015A Differential Equation for Modeling Nesterov's Accelerated Gradient Method: Theory and Insightscited by 203
  5. 2015Stochastic modified equations and adaptive stochastic gradient algorithmscited by 141
  6. 2016A Variational Perspective on Accelerated Methods in Optimizationcited by 108
  7. 2018A Continuous-Time View of Early Stopping for Least Squarescited by 67
  8. 2018On Markov Chain Gradient Descentcited by 63
  9. 2020Least Squares Regression with Markovian Data: Fundamental Limits and Algorithmscited by 56
  10. 2019A Dynamical Systems Perspective on Nesterov Accelerationcited by 33
  11. 2020Fractional Underdamped Langevin Dynamics: Retargeting SGD with Momentum under Heavy-Tailed Gradient Noisecited by 33
  12. 2019Continuous Time Analysis of Momentum Methodscited by 32
10 more
  1. 2016A Lyapunov Analysis of Momentum Methods in Optimizationcited by 28
  2. 2017The Approximate Duality Gap Technique: A Unified Theory of First-Order Methodscited by 27
  3. 2019Acceleration via Symplectic Discretization of High-Resolution Differential Equationscited by 27
  4. 2020Optimization with Momentum: Dynamical, Control-Theoretic, and Symplectic Perspectivescited by 27
  5. 2018Direct Runge-Kutta Discretization Achieves Accelerationcited by 21
  6. 2020Finite-Time Analysis of Stochastic Gradient Descent under Markov Randomnesscited by 18
  7. 2020Convergence Rates of Accelerated Markov Gradient Descent with Applications in Reinforcement Learningcited by 15
  8. 2020Non-asymptotic Convergence of Adam-type Reinforcement Learning Algorithms under Markovian Samplingcited by 15
  9. 2021A Continuized View on Nesterov Acceleration for Stochastic Gradient Descent and Randomized Gossipcited by 15
  10. 2019Accelerated First-Order Methods: Differential Equations and Lyapunov Functionscited by 5

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2026: 1.

1 paper.