[Tech Insight] MUON+: Simple Normalization is the Secret Sauce for Faster Pre-training
Muon+: Towards Better Muon via One Additional Normalization Step
This paper introduces MUON+, an enhanced version of the Muon optimizer designed for large-scale language model pre-training. By adding a simple yet effective row/column normalization step after gradient orthogonalization, MUON+ achieves state-of-the-art convergence across GPT and LLaMA architectures.
TL;DR
The community recently pivoted towards Muon, an optimizer that orthogonalizes gradients to prevent rank collapse. However, a new challenger, MUON+, proves that adding a single normalization step after orthogonalization can yield massive gains. Across GPT and LLaMA models up to 1B parameters, MUON+ consistently lowers perplexity and makes training significantly more robust to learning rate swings.
The Problem: Orthogonalization is Not Enough
Standard optimizers like AdamW rely on vector-wise scaling. Muon changed the game by treating layers as matrices and enforcing orthogonality, effectively keeping the "rank" of the gradient high.
However, the authors of MUON+ noticed a gap: while the gradients were orthogonal, their structural magnitudes were still suboptimal. While other recent variants tried to fix this with "second-moment scaling" (NorMuon) or "manifold optimization" (Mano), these additions were computationally heavy. The researchers at UCSB asked a critical question: Is the complexity necessary, or is it just the normalization that matters?
Methodology: The Power of One Extra Step
The core of MUON+ is deceptively simple. After computing the momentum and orthogonalizing it into using Newton-Schulz iterations, MUON+ applies a row-wise or column-wise normalization:
Model Architecture and Update Flow

The authors tested four directions:
- Column-wise: Normalizing the scale of each output feature.
- Row-wise: Normalizing the contribution of each input feature.
- Col-Row / Row-Col: Bi-directional normalization.
Interestingly, they found that Row-wise and Col-Row normalization consistently provided the best results, suggesting that balancing the input-side influence is vital for stable transformer training.
Experimental Results: SOTA Performance
MUON+ was tested in "compute-optimal" settings (where token count scales with parameters) and "overtraining" settings (up to 200 tokens per parameter).
Performance Gains across Architectures
| Model | Params | Muon Perplexity | MUON+ Perplexity | Delta |
|---|---|---|---|---|
| GPT-Small | 124M | 29.66 | 27.64 | -2.02 |
| GPT-Base | 362M | 21.70 | 19.98 | -1.72 |
| LLaMA-1B | 1.3B | 10.68 | 10.31 | -0.37 |
Stability and Robustness
One of the most striking findings is the learning rate sensitivity. In the figure below, MUON+ (colored lines) stays at a lower perplexity across a much wider range of learning rates compared to the original Muon (None).

Deep Insight: Decoupling Complexity
The paper includes a brilliant ablation study against NorMuon. By setting (removing the second-moment/Adam-like scaling), they proved that the performance didn't drop. This suggests that the "Adaptive" part of "Adaptive Optimizers" might be less important than simple "Structural Normalization" when gradients are already orthogonal.
Conclusion & Future Outlook
MUON+ demonstrates that in the world of LLM optimization, Less is More. By adding a simple normalization step that costs almost zero extra FLOPs, we can achieve better convergence than much more complex manifold-based methods.
Limitations: The study primarily focuses on models up to 1.3B parameters. Scaling this to 70B+ models will be the next frontier to see if these structural benefits hold at the "Extreme Scale."
Paper cited: Zhang et al. (2025). MUON+: Towards Better Muon via One Additional Normalization Step. UCSB.
