From Parallel to Sequential: Small-Batch Noise Restores Simplicity Bias of Muon
Not on the map. Why?
Abstract (arXiv)
Simplicity bias, which can arise from sequential feature learning during training, has been proposed as a general explanation for the success of deep learning. An important driver of this phenomenon is saddle-to-saddle behavior, in which the gradient flow trajectory remains close to a sequence of saddle manifolds while learning one feature at a time. However, Muon, a state-of-the-art optimizer based on spectral descent, does not exhibit such dynamics in the full-batch setting and instead learns features in parallel. How is it then that Muon is so successful in deep learning settings? We show that stochastic gradient noise fundamentally changes this behavior: small-batch noise restores sequential feature learning, providing a mechanism for simplicity bias that is absent from full-batch Muon. We explain this transition through stochastic smoothing of the spectral descent operator underlying Muon. When gradients are small relative to the noise scale, the expected spectral update becomes approximately proportional to the actual gradient, which restores gradient-flow-like dynamics. We formalize this mechanism for deep linear models by deriving the effective continuous dynamics of noisy spectral descent. Experiments on low-rank matrix reconstruction, vision transformers, and large language models (LLMs) support these findings.
Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 61 of its 71 references that are in the map. First posted on arXiv 12 Oct 2026.
Builds on
61 of 71 references.
References · 61
- 2023LLaMA: Open and Efficient Foundation Language Modelscited by 14,132
- 2020Training data-efficient image transformers & distillation through attentioncited by 4,586
- 2024The FineWeb Datasets: Decanting the Web for the Finest Text Data at Scalecited by 1,160
- 2013Exact solutions to the nonlinear dynamics of learning in deep linear neural networkscited by 763
- 2019Implicit Regularization in Deep Matrix Factorizationcited by 405
- 2020Kernel and Rich Regimes in Overparametrized Modelscited by 306
- 2017How to Escape Saddle Points Efficientlycited by 285
- 2018Characterizing Implicit Bias in Terms of Optimization Geometrycited by 266
- 2019A Tail-Index Analysis of Stochastic Gradient Noise in Deep Neural Networkscited by 214
- 2021The Low-Rank Simplicity Bias in Deep Networkscited by 154
- 2019Implicit Regularization of Discrete Gradient Dynamics in Linear Neural Networkscited by 124
- 2020The Heavy-Tail Phenomenon in SGDcited by 124
38 more
- 2021Implicit Bias of SGD for Diagonal Linear Networks: a Provable Benefit of Stochasticitycited by 110
- 2019Implicit Regularization for Optimal Sparse Recoverycited by 80
- 2024Modular Duality in Deep Learningcited by 77
- 2022Gradient flow dynamics of shallow ReLU networks for square loss and orthogonal inputscited by 76
- 2023Transformers as Support Vector Machinescited by 74
- 2021On the Implicit Bias of Initialization Shape: Beyond Infinitesimal Mirror Descentcited by 70
- 2022SGD with Large Step Sizes Learns Sparse Featurescited by 68
- 2025Benchmarking Optimizers for Large Language Model Pretrainingcited by 68
- 2023Saddle-to-Saddle Dynamics in Diagonal Linear Networkscited by 57
- 2024From Lazy to Rich: Exact Learning Dynamics in Deep Linear Networkscited by 49
- 2019First Exit Time Analysis of Stochastic Gradient Descent Under Heavy-Tailed Gradient Noisecited by 44
- 2020The Geometry of Sign Gradient Descentcited by 41
- 2025Implicit Bias of Spectral Descent and Muon on Multiclass Separable Datacited by 41
- 2021Stochastic gradient descent with noise of machine learning type. Part I: Discrete time analysiscited by 39
- 2022Implicit Bias of Gradient Descent on Reparametrized Models: On Equivalence to Mirror Descentcited by 39
- 2018Hessian Riemannian gradient flows in convex programmingcited by 26
- 2022Mirror Descent Maximizes Generalized Margin and Can Be Implemented Efficientlycited by 26
- 2022Explicit Regularization in Overparametrized Models via Noise Injectioncited by 26
- 2021More is Less: Inducing Sparsity via Overparameterizationcited by 24
- 2024Flavors of Margin: Implicit Bias of Steepest Descent in Homogeneous Neural Networkscited by 18
- 2025Saddle-to-Saddle Dynamics Explains A Simplicity Bias Across Neural Network Architecturescited by 15
- 2026Sign-Based Optimizers Are Effective Under Heavy-Tailed Noisecited by 15
- 2024Mask in the Mirror: Implicit Sparsificationcited by 14
- 2026Muon is Not That Special: Random or Inverted Spectra Work Just as Wellcited by 14
- 2023Robust Implicit Regularization via Weight Normalizationcited by 12
- 2024On the Optimization and Generalization of Two-layer Transformers with Sign Gradient Descentcited by 12
- 2025Mirror, Mirror of the Flow: How Does Regularization Shape Implicit Bias?cited by 12
- 2023Are GATs Out of Balance?cited by 10
- 2026To Use or not to Use Muon: How Simplicity Bias in Optimizers Matterscited by 10
- 2026Enhancing LLM Training via Spectral Clippingcited by 10
- 2024Implicit Bias of Mirror Flow on Separable Datacited by 9
- 2024Singular-limit analysis of gradient descent with noise injectioncited by 7
- 2024Exact Risk Curves of signSGD in High-Dimensions: Quantifying Preconditioning and Noise-Compression Effectscited by 7
- 2024Implicit Bias of Mirror Flow for Shallow Neural Networks in Univariate Regressioncited by 6
- 2024GATE: How to Keep Out Intrusive Neighborscited by 5
- 2025Unbiased and Sign Compression in Distributed Learning: Comparing Noise Resilience via SDEscited by 5
- 2024Three Mechanisms of Feature Learning in a Linear Networkcited by 4
- 2026Never Saddle for Reparameterized Steepest Descent as Mirror Flowcited by 4
50 most cited of 61 All 61 (JSON)
Built on by
Not cited yet.