Reproduce “Muon Attains $\mathcal{O}(\varepsilon^{-3})$ Iteration Complexity under Shuffling” on OpenResearch

Turn your favorite coding agents into research agents that review literature, develop hypotheses, and run experiments.

Universal app for Apple silicon and Intel. Requires macOS 11 or later.

About this paper

Kun Huang, Shi Pu, Karl Henrik Johansson

The authors analyze exact-polar Muon under epoch-wise shuffling for smooth nonconvex finite-sum problems, where every component is visited once per epoch. Their guarantee gives O(ε⁻³) iterations for the average nuclear-norm gradient measurement to be at most ε, matching SGD’s shuffling exponent under growth and smoothness assumptions. A constructed counterexample shows no fixed momentum coefficient works for all component counts.

Summary by alphaXiv.

Tip: change arxiv.org to autoarxiv.org in any arXiv abstract link to open the paper here.