From Spectral to Frobenius: When Muon Loses Its Spectral Implicit Bias
Not on the map. Why?
Abstract (arXiv)
Prior work on implicit bias shows that gradient descent selects the Frobenius max-margin direction on linearly separable problems, whereas Fan et al. (2025) established spectral max-margin behavior for spectral-norm steepest descent methods, including idealized Muon with exact orthogonalization. In practice, however, Muon approximates orthogonalization using finite Newton-Schulz iterations and a positive stabilization constant. We prove that these implementation choices cause Muon to select the Frobenius rather than the spectral max-margin direction in linear classification with separable data. We also establish this behavior for both exponential moving average and Nesterov-style momentum. The key technical ingredient is a summable perturbation argument showing that the resulting parameter trajectories remain at bounded distance from those of gradient descent. We then disentangle the roles of Newton-Schulz iteration count, the stabilization constant, and the Newton-Schulz polynomial, revealing distinct asymptotic behaviors, including directions that achieve neither Frobenius nor spectral max-margin. Finally, we show that Muon can recover its spectral max-margin bias with Newton-Schulz iterations growing logarithmically over training.
Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 28 of its 33 references that are in the map. First posted on arXiv 14 Oct 2026.
Builds on
28 of 33 references.
References · 28
- 2017The Implicit Bias of Gradient Descent on Separable Datacited by 655
- 2025Muon is Scalable for LLM Trainingcited by 428
- 2014In Search of the Real Inductive Bias: On the Role of Implicit Regularization in Deep Learningcited by 342
- 2017Implicit Regularization in Matrix Factorizationcited by 322
- 2019Gradient Descent Maximizes the Margin of Homogeneous Neural Networkscited by 320
- 2018Characterizing Implicit Bias in Terms of Optimization Geometrycited by 266
- 2024Old Optimizer, New Norm: An Anthologycited by 193
- 2020Directional convergence and alignment in deep learningcited by 178
- 2018Convergence of Gradient Descent on Separable Datacited by 110
- 2025The Polar Express: Optimal Matrix Sign Methods and Their Application to the Muon Algorithmcited by 110
- 2018Stochastic Gradient Descent on Separable Data: Exact Convergence with a Fixed Learning Ratecited by 64
- 2020Gradient descent follows the regularization path for general lossescited by 59
16 more
- 2020The Implicit Bias for Adaptive Optimization Algorithms on Homogeneous Neural Networkscited by 46
- 2025Implicit Bias of Spectral Descent and Muon on Multiclass Separable Datacited by 41
- 2024The Implicit Bias of Adam on Separable Datacited by 36
- 2026Convergence of Muon with Newton-Schulzcited by 36
- 2021Does Momentum Change the Implicit Regularization on Separable Data?cited by 22
- 2013An Almost-Linear-Time Algorithm for Approximate Max Flow in Undirected Graphs, and its Multicommodity Generalizationscited by 19
- 2024Flavors of Margin: Implicit Bias of Steepest Descent in Homogeneous Neural Networkscited by 18
- 2019The Implicit Bias of AdaGrad on Separable Datacited by 16
- 2023A Unified Approach to Controlling Implicit Regularization via Mirror Descentcited by 14
- 2026The Implicit Bias of Adam and Muon on Smooth Homogeneous Neural Networkscited by 11
- 2024Implicit Bias of Mirror Flow on Separable Datacited by 9
- 2026Muon with Finite Newton-Schulz: The Smoothing Benefit in Nonsmooth Nonconvex Optimizationcited by 5
- 2026The Implicit Bias of Steepest Descent with Mini-batch Stochastic Gradientcited by 4
- 2026Stability Annealing Selects the Implicit Bias of Smoothed Sign Descent: A Rate-Indexed Barrier Path on Separable Datacited by 2
- 2026Convergence guarantees for Muon: New parameter regimes and generalizationscited by 2
- 2026Convergence of Practical Muon with Finite Newton-Schulz Iterations and Nesterov Momentumcited by 1
Built on by
Not cited yet.