arXiv paper gives StopGrads theoretical grounding: convergence without an underlying loss

srush_nlp · x · 2026-10-23

An arXiv paper by Max W. Shen, Mark Goldstein, Rajesh Ranganath et al. systematically studies stopgrads — ubiquitous in ML training but rarely analyzed.

Problem: stopgrads alter gradients, stationary points, and convergence guarantees, leaving training theoretically ungrounded — parameters follow a vector field that may not be the gradient of any loss.

Contributions:

The person who got scooped (Assaf Shocher) publicly endorses it: the authors explicitly solved idealized training dynamics and showed convergence to the right solution despite no underlying loss.

Original post →

More from Research

Research channel →