Skip to content
AI News HubLIVE
Original source2 min read

The Active Ingredient in Muon's Grokking

Summary

A study decomposes Muon's speedup in grokking modular arithmetic, finding orthogonalization (Newton-Schulz iteration) as the key mechanism, not spectral norm constraints. Orthogonalization achieves generalization at 3x lower spectral norm and leads to lower-norm solutions. Reducing Newton-Schulz iterations speeds up grokking but makes solutions fragile.

SourcearXiv Machine LearningAuthor: Yufeng Wang
The Active Ingredient in Muon's Grokking
Report an error

The correction channel is not available yet. You can copy the article reference below for later.

Correction instructions
Read article

[Submitted on 6 Jul 2026]

Title:The Active Ingredient in Muon's Grokking

View a PDF of the paper titled The Active Ingredient in Muon's Grokking, by Yufeng Wang

View PDF HTML (experimental)

Abstract:The Muon optimizer reaches the grokking threshold on modular arithmetic faster than AdamW. Prior work attributes this to "spectral-norm constraints plus orthogonalized momentum" but does not isolate which mechanism matters. To better understand Moun's behavior, we run multi-seed and multi-learning-rate sweeps to decompose and stress-test the effect. First, an ablation shows the speedup comes from orthogonalization (the Newton-Schulz iteration): orthogonalize-only matches full Muon, whereas spectral-only is no faster than AdamW and is unreliable, and this verdict holds across learning rates. Second, a mechanistic analysis finds that orthogonalizing optimizers reach generalization at roughly 3x lower spectral norm and, controlling for how much the embedding actually moves, settle into a lower-norm solution rather than simply perturbing the embedding less. Third, reducing the Newton-Schulz iteration count from five to one accelerates reaching the threshold but makes the grokked solution fragile, prone to transient collapse, with fragility that grows with learning rate; a single iteration is fast and stable only at small learning rate, while the canonical five iterations are the learning-rate-robust choice. We also show spectral scaling can be dropped at no measured cost. A methodological thread runs throughout: under a stability-aware metric, "faster" claims about grokking optimizers can invert, so we report both first-crossing and sustained-grok times. To support reproducibility, we release our full training and analysis code at this https URL

Subjects:

Machine Learning (cs.LG); Artificial Intelligence (cs.AI)

Cite as: arXiv:2607.20512 [cs.LG]

(or arXiv:2607.20512v1 [cs.LG] for this version)

https://doi.org/10.48550/arXiv.2607.20512

arXiv-issued DOI via DataCite (pending registration)

Submission history

From: Yufeng Wang [view email] [v1] Mon, 6 Jul 2026 22:35:57 UTC (34 KB)

Full-text links:

Access Paper:

View a PDF of the paper titled The Active Ingredient in Muon's Grokking, by Yufeng Wang

View PDF

HTML (experimental)

TeX Source

view license

Current browse context:

cs.LG

new | recent | 2026-07

Change to browse by:

cs cs.AI

References & Citations

NASA ADS

Google Scholar

Semantic Scholar

Loading...

Data provided by:

Bibliographic Tools

Bibliographic and Citation Tools

Bibliographic Explorer Toggle

Bibliographic Explorer (What is the Explorer?)

Connected Papers Toggle

Connected Papers (What is Connected Papers?)

Litmaps Toggle

Litmaps (What is Litmaps?)

scite.ai Toggle

scite Smart Citations (What are Smart Citations?)

Code, Data, Media

Code, Data and Media Associated with this Article

alphaXiv Toggle

alphaXiv (What is alphaXiv?)

Links to Code Toggle

CatalyzeX Code Finder for Papers (What is CatalyzeX?)

DagsHub Toggle

DagsHub (What is DagsHub?)

GotitPub Toggle

Gotit.pub (What is GotitPub?)

Huggingface Toggle

Hugging Face (What is Huggingface?)

ScienceCast Toggle

ScienceCast (What is ScienceCast?)

Demos

Demos

Replicate Toggle

Replicate (What is Replicate?)

Spaces Toggle

Hugging Face Spaces (What is Spaces?)

Spaces Toggle

TXYZ.AI (What is TXYZ.AI?)

Related Papers

Recommenders and Search Tools

Link to Influence Flower

Influence Flower (What are Influence Flowers?)

Core recommender toggle

CORE Recommender (What is CORE?)

IArxiv recommender toggle

IArxiv Recommender (What is IArxiv?)

Author

Venue

Institution

Topic

About arXivLabs

arXivLabs: experimental projects with community collaborators

arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.

Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.

Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.

Which authors of this paper are endorsers? | Disable MathJax (What is MathJax?)

Key points and analysis

Article intelligence

ResearchersAdvanced

Key points

  • Orthogonalization (Newton-Schulz iteration) is the active ingredient behind Muon's speedup over AdamW in grokking modular arithmetic; spectral norm constraints alone provide no speedup.
  • Orthogonalizing optimizers generalize at roughly 3x lower spectral norm and settle into lower-norm solutions, not merely perturbing embeddings less.
  • Reducing Newton-Schulz iterations from five to one accelerates reaching the grokking threshold but makes solutions fragile and prone to transient collapse, with fragility increasing with learning rate.
  • Spectral scaling can be dropped without performance loss; a stability-aware metric reveals that "faster" claims can invert, so both first-crossing and sustained-grok times are reported.

Why it matters

Identification of orthogonalization as the active ingredient clarifies prior attribution and guides future optimizer design.

Technical impact

May influence optimizer design, evaluation metrics, and open-source reproducibility practices.

Highlights and analysis are generated automatically and may contain errors. Check the original source.