MuonIO: Principled Norm-Aware Descent for Embedding Tables and Language Model Heads

arXiv:2610.02705 · cs.LG, cs.AI · Submitted 2026-10-02 · Read on arXiv

cs.LG, cs.AI

Submitted: 2026-10-02

Updated: 2026-10-02

License: http://creativecommons.org/licenses/by/4.0/

The gist: The Muon optimizer derives its update rule for hidden linear layers by solving a local linearization of the loss penalized by the spectral norm, motivated by an RMS-stability argument for dense

Abstract

The Muon optimizer derives its update rule for hidden linear layers by solving a local linearization of the loss penalized by the spectral norm, motivated by an RMS-stability argument for dense linear layers. Standard Muon implementations, however, exclude the input (embedding table) and output (language model head) layers from this principled treatment, for which they use AdamW instead. We present MuonIO, a single Muon-style update for both of these layers. For the language model head L in R V times d, we motivate the use of the 2 to infinity operator norm, due to the Lipschitz continuity of the softmax output geometry, while for the embedding table E in R d times V, we draw on the 1 to 2 operator norm, based on the one-hot input geometry identified by Bernstein & Newhouse (2025). The identity L 2 to infinity= L 1 to2 then puts both matrices in the same vocabulary-oriented geometry: MuonIO applies a single normalized-vector rule, which appears as column normalization for E and row normalization for L. Empirical evaluations demonstrate the effectiveness of our approach, with MuonIO reducing I/O optimizer state memory by 50% and I/O update FLOPs by about 46% compared to Muon for 1B LLaMA pretraining on C4, while also improving validation perplexity.

Sources

Related papers