CoLM 2026

MuonQ

Enhancing Low-Bit Muon Quantization via Directional Fidelity Optimization

A pure 4-bit training framework for the Muon optimizer — matching full-precision quality while cutting optimizer-state memory by up to 7.3×.

Yupeng Su1Ruijie Zhang1Ziyue Liu1Yequan Zhao1Zheng Zhang1

1 University of California, Santa Barbara  ·  {yupengsu, zzhang01}@ucsb.edu

Abstract

Preserve the direction, not the magnitude.

The Muon optimizer is a compelling alternative to Adam for training LLMs, achieving large compute savings through gradient orthogonalization. But Muon's state is unusually sensitive to quantization: orthogonalization discards singular-value magnitudes and keeps only directional information, so tiny errors in singular-vector directions get amplified into the update.

MuonQ is a low-bit Muon framework built on directional fidelity optimization — three complementary techniques that together enable stable pure 4-bit quantization of Muon's optimizer states, recovering most of full-precision Muon's loss and downstream accuracy while cutting optimizer-state memory by up to 7.3×.

1

Pre-quantization normalization

Unit-normalize before quantizing so every step injects equal-magnitude error — no preferred direction accumulates.

2

Structural decomposition

Quantize the singular factors separately, so errors rescale singular components instead of rotating their directions.

3

μ-law companding

Reallocate quantization bins toward the dense near-zero region where distinguishability matters most.

Method · a three-stage pipeline

Directional fidelity optimization

Muon's polar step maps every singular value to one, so only the error component that rotates singular vectors survives. MuonQ therefore targets the cosine similarity of the momentum, not its reconstruction error — attacking directional error at three stages of a single training step.

Algorithm 1 · A single MuonQ training step
Input: gradient Gt, learning rate η, momentum β, bit-width b, rank k, weights Wt-1, and quantized states (U, S, R) — or ∅ at t = 1.
1if t = 1:   M̂t-1 ← 0 ;   Ŝt-1 ← 𝒩(0, I)
2else:   dequant Û, Ŝ, R̂  →  M̂t-1 ← Ût-1t-1 + R̂t-1
1 Pre-quantization normalization
3Mt ← β M̂t-1 + Gt / ‖GtF
4t ← Mt / ‖MtF  // unit-norm momentum
2 Structural decomposition · power iteration
5Vt-1RowNorm(Ŝt-1)
6Utorth(M̄t Vt-1) ;   St ← Utt ;   Rt ← M̄t − UtSt
3 Companding quantization
7quantize  Ut (col),  St (row),  Rt (group)  →  4-bit states
8Wt ← Wt-1 − η · polar(M̄t)  // parameter update
1

Pre-quantization normalization

Gradient and momentum norms swing across steps, so per-step quantization error swings too — and accumulates into an anisotropic drift the polar step is sensitive to. Normalizing both to unit Frobenius norm before quantizing makes every step inject equal-magnitude, isotropic error that never develops a preferred direction.

Gradient Normalize Add momentum Normalize Unit momentum Decompose · Quantize · Update
Where it plugs in. Normalization is inserted at two points — on the incoming gradient and on the accumulated momentum — before any decomposition or quantization.
Accumulated relative error and cosine similarity over 50 momentum steps, with and without normalization
Effect. Accumulated error over 50 momentum steps. Without normalization (red), relative error and cosine similarity degrade monotonically; normalization holds them flat.
2

Structural decomposition for orthogonalization stability

Orthogonalization amplifies directional error. MuonQ decomposes momentum via truncated top-k SVD (warm-started power iteration) and quantizes each factor separately — left singular vectors column-wise, scaled right vectors row-wise. Each singular direction becomes its own quantization group, so errors only rescale singular components rather than rotating them, and the polar step absorbs them.

before orthogonalization
after orthogonalization
no decomp. (k=0)
Singular spectrum without decomposition, before orthogonalization
Singular spectrum without decomposition, after orthogonalization — error amplified
with decomp. (k=512)
Singular spectrum with decomposition, before orthogonalization
Singular spectrum with decomposition, after orthogonalization — fidelity preserved
Singular-value spectra of the quantized momentum on layers.6.self_attn.k_proj. Top row (no decomposition): orthogonalization severely amplifies quantization error. Bottom row (with decomposition): directional fidelity is preserved straight through the polar step.
3

μ-law companding quantization

Because Muon weights all singular directions equally, resolution near zero — where momentum values pack densely — matters more than preserving outliers. MuonQ applies μ-law companding (μ = 255) to reallocate quantization bins toward this dense central region, shifting the objective from outlier preservation to dense-region distinguishability.

Mu-law companding reallocates quantization bins toward the dense near-zero region
Momentum distribution (top) and quantization-interval bands (bottom); each block is one bin. μ-law packs finer bins where values concentrate, wider bins in the sparse tails.
Gran.RE↓
Uni.
RE↓
Comp.
CS↑
Uni.
CS↑
Comp.
Tensor0.5090.2380.8790.973
Row0.1270.1110.9920.994
Column0.2540.1590.9690.988
4-bit quantization of k_proj. Companding (Comp.) lowers reconstruction error and raises cosine similarity at every granularity.
Results

4-bit training that tracks full precision

Pre-training on GPT-2 (Medium / Large) and LLaMA (350M / 1.1B) over FineWeb, all under the standard Muon protocol on A100s. MuonQ4 hugs the Muon32 curve from the first steps, while naive Muon4 never closes its gap.

GPT-2 Medium training loss
GPT-2 Medium
LLaMA 350M training loss
LLaMA-350M
LLaMA 1.1B training loss
LLaMA-1.1B
Training-loss curves on FineWeb. MuonQ4 closely tracks full-precision Muon32; naive Muon4's gap grows with scale.
Validation perplexity and optimizer-state memory across model scales
Perplexity vs. optimizer memory. Across scales, MuonQ4 nearly closes the PPL gap to Muon32 while cutting optimizer-state memory by up to 7.3×.

Zero-shot downstream accuracy

ModelOpt.ARC-cARC-eOBQABoolQHellaS.PIQAWinoG.Avg.
GPT-2 MediumMuon3223.539.727.857.433.165.151.342.6
Muon824.439.529.056.432.164.651.242.5
Muon422.431.925.062.026.658.250.639.5
MuonQ4ours23.937.825.660.730.263.150.841.7
GPT-2 LargeMuon3224.042.629.456.437.967.249.443.8
Muon823.741.030.059.836.266.750.143.9
Muon421.135.123.461.827.558.250.039.6
MuonQ4ours22.839.830.259.833.865.251.543.3
LLaMA 350MMuon3222.638.528.462.034.365.751.943.3
Muon822.938.227.661.232.363.453.742.8
Muon421.529.625.061.927.055.950.038.7
MuonQ4ours22.438.127.860.931.063.751.642.2
LLaMA 1.1BMuon3226.445.230.460.945.969.651.347.1
Muon824.442.331.461.341.269.652.246.1
Muon422.234.125.660.328.558.749.639.8
MuonQ4ours25.041.830.460.740.368.349.945.2
Zero-shot accuracy (%, higher is better). MuonQ4 trails Muon32 by only about one point on average and recovers most of the accuracy lost by naive Muon4.

Head-to-head on LLaMA 1.1B

MethodVal PPL ↓Opt. Mem.Mem. ↓Step timeOverhead
Muon3211.474.50 GB1.00×4408 ms
Muon812.421.13 GB4.00×4434 ms+0.58%
Muon423.180.56 GB8.00×4482 ms+1.68%
GRASP (8/4-bit)12.330.75 GB6.02×4833 ms+9.64%
MuonQ4ours12.670.62 GB7.28×4881 ms+10.72%
Under identical training settings vs. mixed-precision GRASP. Pure 4-bit MuonQ4 reaches the largest memory reduction of any method at essentially no accuracy cost.
Ablation · GPT-2 Small, 1B tokens

Every component earns its place

MethodCompandNormDecompPPL ↓Mem. ↓
Muon3236.4324.0 MB
Muon469.940.5 MB · 8.0×
MuonQ466.6 ↓3.340.5 MB · 8.0×
MuonQ450.0 ↓19.940.5 MB · 8.0×
MuonQ446.2 ↓23.740.5 MB · 8.0×
MuonQ444.7 ↓25.244.3 MB · 7.3×
MuonQ4full40.9 ↓29.044.3 MB · 7.3×
Each technique helps independently; decomposition gives the largest single gain, and the full stack reaches the best PPL–memory trade-off.
Effect of truncation rank on validation PPL and optimizer memory
Truncation rank. PPL improves sharply up to k = 1/16, then flattens while memory keeps rising — so 1/16 is the default (+9.4% memory).
Training loss of full-precision Muon with and without pre-quantization normalization
Normalization is loss-neutral. Added to full-precision Muon, it leaves training curves unchanged — confirming it doesn't alter optimization dynamics.
Acknowledgements

This material is based upon work supported by the U.S. Department of Energy, Office of Science, Office of Advanced Scientific Computing Research, Artificial Intelligence for Science program, under contract DE-SC0025390. This research used resources of the National Energy Research Scientific Computing Center (NERSC), a DOE Office of Science User Facility, under Contract No. DE-AC02-05CH11231, using NERSC awards ASCR-ERCAP0030039 and ALCC-ERCAP0031379.

Citation

BibTeX

@inproceedings{su2026muonq,
  title     = {MuonQ: Enhancing Low-Bit Muon Quantization
               via Directional Fidelity Optimization},
  author    = {Su, Yupeng and Zhang, Ruijie and Liu, Ziyue
               and Zhao, Yequan and Zhang, Zheng},
  booktitle = {Conference on Language Modeling (CoLM)},
  year      = {2026},
  url       = {https://arxiv.org/abs/2605.11396}
}
Enlarged figure