mlsanityData to 14 Oct 2026

Muon Under Gradient Noise and the Limits of Orthogonalization Near Optima

arXiv 2609.32861 ↗First posted 26 Sep 2026cs.LGcited by 0

Not on the map. Why?

Abstract (arXiv)

Muon replaces the momentum buffer of each weight matrix by its orthogonal polar factor. We ask what this orthogonalization does near an optimum, where minibatch noise dominates the gradient. Under a Gaussian noise model, the expected Muon update becomes a scaled gradient step, so a linear method with a suitably matched learning rate reproduces Muon's first-order mean response. The stochastic update is a different matter: after the response is matched, Muon retains a nonlinear residual that is uncorrelated with the input noise and contributes additional covariance. A Hermite expansion shows how momentum acts on this residual. Its higher-order components decorrelate faster than the linear component, so momentum suppresses the residual's accumulated covariance relative to the linear part, but never eliminates it. In a local quadratic surrogate that evaluates the residual on the stationary noise buffer, the residual adds stationary covariance and raises the stationary loss floor at every stable step size, while leaving the contraction dynamics unchanged. Simulations of the full nonlinear recursion on quadratics and measurements on frozen transformer gradients support each step of this picture. Together, the results make a theoretical case for replacing orthogonalization by response-matched momentum SGD once optimization becomes noise-dominated.

Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 17 of its 24 references that are in the map. First posted on arXiv 26 Sep 2026.

Builds on

17 of 24 references.

References · 17

  1. 2018signSGD: Compressed Optimisation for Non-Convex Problemscited by 571
  2. 2025Muon is Scalable for LLM Trainingcited by 428
  3. 2017Stochastic Gradient Descent as Approximate Bayesian Inferencecited by 300
  4. 2024Old Optimizer, New Norm: An Anthologycited by 193
  5. 2025Training Deep Learning Models with Norm-Constrained LMOscited by 192
  6. 2015Stochastic modified equations and adaptive stochastic gradient algorithmscited by 142
  7. 2017Dissecting Adam: The Sign, Magnitude and Variance of Stochastic Gradientscited by 139
  8. 2025The Polar Express: Optimal Matrix Sign Methods and Their Application to the Muon Algorithmcited by 110
  9. 2025Understanding Gradient Orthogonalization for Deep Learning via Non-Euclidean Trust-Region Optimizationcited by 92
  10. 2025A Note on the Convergence of Muoncited by 83
  11. 2024Modular Duality in Deep Learningcited by 77
  12. 2020Noise and Fluctuation of Finite Learning Rate Stochastic Gradient Descentcited by 37
5 more
  1. 2026Convergence of Muon with Newton-Schulzcited by 36
  2. 2025On the Convergence of Muon and Beyondcited by 31
  3. 2024Adaptive Methods through the Lens of SDEs: Theoretical Insights on the Role of Noisecited by 23
  4. 2026Muon with Nesterov Momentum: Heavy-Tailed Noise and (Randomized) Inexact Polar Decompositioncited by 8
  5. 2026Denoise First, Orthogonalize Later: Understanding Momentum in Muon via Spectral Filteringcited by 2

Built on by

Not cited yet.