Skip to content
Preprint

Scaling Muon for Diffusion Transformers

Aug 2026 · 0 citations · 37 references
Computer Science

TL;DR

Periodic Row-wise Muon is introduced, which performs a full NS5 spectral update once every \(K\) steps and applies a low compute and communication cost row-wise constrained update based on the current momentum at the remaining steps to preserve Muon's generative quality advantage while translating it into end-to-end training efficiency for large DiTs.

Abstract

The matrix-aware optimizer Muon improves large model training by balancing updates across singular directions, yet its scaling behavior and end-to-end efficiency on large Diffusion Transformers (DiTs) remain unclear. We first establish Muon's scaling behavior on DiTs from 1.3B to 15B parameters, showing that its optimization and generative quality advantages over AdamW persist across model scales. However, at scale, the 5-step Newton--Schulz iteration (NS5) performed at every optimization step, together with full-momentum materialization, introduces substantial computation and communication overhead that can offset Muon's step-efficiency advantage. We introduce \emph{Periodic Row-wise Muon}, which performs a full NS5 spectral update once every \(K\) steps and applies a low compute and communication cost row-wise constrained update based on the current momentum at the remaining steps. We further co-design a distributed implementation that operates directly on sharded momentum during non-refresh steps and accelerates spectral refreshes through bucketed all-gather and communication--computation overlap. Across all scales, Muon improves the best observed generative quality over AdamW by 12.9--19.1\%. Compared with vanilla Muon, Periodic Row-wise Muon remains within 0.5\% in best generative quality on the 1.3B--4B models and improves it by 4.5\% at 9B. It reduces optimizer time by 46.9--54.3\%, end-to-end step time by 15.7--24.3\%, and logical communication volume by 66.7\%, while reaching its respective best generative quality with 33.7--64.8\% less active training time. These results show that Periodic Row-wise Muon preserves Muon's generative quality advantage while translating it into end-to-end training efficiency for large DiTs.

View source

Similar papers

#small language model Preprint Aug 2026

Spectral Allocation: Why Muon Outperforms Adam, and How to Improve Muon

Spectral-Aware Muon is introduced, which holds the head at the Muon scale and amplifies the bulk using a static spectral prior, and both variants outperform tuned AdamW and Muon (Scion implementation) baselines in all evaluated model-scale and batch-size configurations.

Xiaodong Wu, Wen-Yi Yu, Chao Zhang et al. · 1 citation
Preprint Aug 2026

Dion3: Full-Stack Orthogonal Updates

Dion3, a revision of Muon that targets this overhead at every level of the stack with a simple change to the update rule that cuts costs even further: selecting only a fraction of the momentum matrix's rows to orthogonalize at each step.

Noah Amsel, Jack Zhang, Kwangjun Ahn et al. · 0 citations
Preprint Jul 2026

Reassessing Muon for Matrix Factorization

It is found that Muon does not consistently outperform AdamW in this setting and that several previously reported advantages are sensitive to hyperparameter choices, providing a more nuanced picture of when spectrum-aware orthogonalization is beneficial and arguing for evaluating modern optimizers on controlled problem...

Alipanah Parviz, Gal Mishne, Alex Cloninger · 0 citations
Jul 2026

MatrixFSDP: communication-free matrix optimizers under ZeRO-3 parameter sharding

MatrixFSDP changes where ZeRO-3 shards live, not the optimizer being computed, to match full-matrix Muon while preserving ZeRO-3-scale memory, and reduces optimizer-step latency over stock FSDP2-Muon by 4.2x.

Ming Gao, Yanwu Xu, Hao Zhang · 0 citations
Jul 2026

PoLoRA: A Preconditioned Orthogonalized LoRA Optimizer

PoLoRA is introduced, a Preconditioned Orthogonalized LoRA optimizer built from three ingredients: a product-aware spectral update direction, curvature preconditioning derived from controlling the per-sample loss change, and a magnitude rule that controls the sizes of both the factor and merged updates.

Nikhil Ghosh, Tetiana Parshakova, Robert M. Gower · 1 citation

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.