Polar-Muon Stiefel Optimizer
Implementation & benchmark of arXiv:2608.06218 — Muon on the Stiefel Manifold Admits an Exact Closed-Form Update
Source paper: Muon on the Stiefel Manifold Admits an Exact Closed-Form Update arXiv:2608.06218 ⓘ · analyzed Aug 31, 2026
AI-generated research hypothesis, automatically tested. Not peer-reviewed.
Idea description
Use the negative polar factor of a tangent-projected momentum matrix as the update direction for a weight matrix constrained to the Stiefel manifold. After taking the step, apply a polar retraction so the columns remain exactly orthonormal, avoiding penalty losses and constraint drift.
Formulas
Mathematical statement
The paper's linear minimization oracle solves $\min_{\|B\|_2\leq 1}\langle M,B\rangle$, where $M\in\mathbb{R}^{m\times n}$ is the momentum matrix, $B$ is the update matrix, and $\|\cdot\|_2$ is the spectral norm. If $M=U\Sigma V^\top$ is a thin singular-value decomposition, the exact optimizer is $B^\star=-UV^\top=-\operatorname{polar}(M)$. For a Stiefel parameter $X\in\mathbb{R}^{m\times n}$ satisfying $X^\top X=I_n$, define $\operatorname{sym}(A)=(A+A^\top)/2$ and the tangent projection $P_X(M)=M-X\operatorname{sym}(X^\top M)$. This satisfies $X^\top P_X(M)+P_X(M)^\top X=0$. The adapted direction is $D=-\operatorname{polar}(P_X(M))$. Feasibility is restored using the polar retraction $R_X(\eta D)=\operatorname{polar}(X+\eta D)=(X+\eta D)((X+\eta D)^\top(X+\eta D))^{-1/2}$, assuming full column rank. In practice, if $Z=U\Sigma V^\top$ is a thin SVD, compute $\operatorname{polar}(Z)=UV^\top$.
Implementation notes
(1) Integration point: replace the optimizer update for each rectangular neural-network weight matrix $X\in\mathbb{R}^{m\times n}$ whose columns are intended to remain orthonormal. Suitable targets include tall linear layers, orthogonal projection layers, recurrent transition matrices, and low-rank adapter factors. Do not apply the update to biases or unconstrained parameters. Store a full-precision momentum matrix $M$ with the same shape as $X$.
(2) Pseudocode:
initialize X with orthonormal columns and M = 0
for each minibatch:
loss = model(batch, X)
G = autograd(loss, X)
M = beta*M + (1-beta)*G
S = 0.5*(X.T @ M + M.T @ X)
T = M - X @ S
U, Sigma, Vt = thin_svd(T)
D = -(U @ Vt)
Z = X + eta*D
U2, Sigma2, Vt2 = thin_svd(Z)
X = U2 @ Vt2
The line defining $T$ is the tangent projection $P_X(M)$; the line defining $D$ is the paper's spectral-norm linear-minimization solution; the final SVD is the polar retraction. Use bias correction if desired, but keep the first comparison simple.
(3) Computed directly from the mathematics: the tangent projection, polar direction, and exact orthonormal retraction. Estimated empirically: the learning rate $\eta$, momentum coefficient $\beta$, whether tangent projection is necessary, and the tradeoff between SVD cost and optimization quality. Log $\|X^\top X-I\|_F$, the singular values of $X$, training loss, validation loss, gradient norms, wall-clock time, and SVD FLOPs.
(4) First cheap experiment: train a four-layer width-256 MLP on MNIST or CIFAR-10, making two dense layers Stiefel-constrained. Compare AdamW with an orthogonality penalty, ordinary Muon followed by QR, and this optimizer at matched batch size and approximately matched compute. Sweep $\eta\in\{10^{-3},3\times10^{-3},10^{-2}\}$ and $\beta\in\{0.9,0.95,0.99\}$. A positive result is lower validation loss at equal optimizer steps, near-machine-precision orthogonality without penalty tuning, and equal or better final accuracy. Also report wall-clock performance; repeated SVDs may erase any optimization gain.
Verification
Stage 1 · Toy mechanism gate: Passed ✓
Stage 2 · Mechanism transferred to benchmark: Confirmed ✓
Stage 2 · Practical benchmark result: Significantly worse ✗
Methodology: 8 paired seeds, permutation test (p<0.05) against a learning-rate-tuned baseline. How verification works
Stage 1 — Mechanism check agent confidence 9/10
Built the Polar-Muon Stiefel update with tangent projection, negative polar oracle direction, and polar retraction. The three mechanism predictions were confirmed: tangent residual was 2.56e-15, oracle objective matched -||M||_* with absolute error at most 1.4e-14 and linear scaling, and retraction maintained unit singular values with orthogonality error 2.8e-15–3.6e-15 for eta from 1e-4 to 10. In the toy optimization, Polar-Muon reached loss -37.0577 with machine-precision feasibility, comparable to normalized Riemannian GD (-37.0710) but slower; the penalty baseline reached lower unconstrained loss while drifting substantially.
- Agent confidence
- 9/10
- Baseline
- Riemannian normalized tangent GD: final loss -37.0710, orthogonality error 9.04e-16, 0.0356 s; penalty GD: final loss -43.1167, orthogonality error 2.01, 0.0155 s
- Idea
- Polar-Muon: final loss -37.0577, orthogonality error 3.22e-15, 0.0492 s; tangent residual 2.56e-15; oracle scale slope -17.4094, equal to the nuclear norm
Limitations: Only a small NumPy linear-objective Stiefel toy problem was tested. No neural-network, MNIST/CIFAR, AdamW, full Muon, GPU, hyperparameter sweep, matched-FLOP study, or repeated-seed statistical comparison was performed; random feasible competitors provide a sanity check rather than a formal optimality proof.
How to run: python3 experiment.py
Stage 2 — Benchmark vs. tuned baseline (arXiv:2608.06218)
Significantly WORSE than the tuned baseline (+85.4%, p=0.0081, wins 0 / 8 paired seeds).
- Benchmark
- Tabular regression (Friedman)
- Model
- mlp_tiny
- Paired seeds
- 8
- Baseline mean
- 4.6294
- Idea mean
- 0
- Effect (Δ)
- 3.954 (+85.4%; negative = idea better)
- Wins
- 0 / 8 paired seeds
- p-value
- 0.0081 (permutation test, 20 000 shuffles)
- Smallest detectable effect
- n/a
- Mechanism
- Confirmed ✓
- Practical effect
- Hurts
- Baseline tuning
- swept over 0 configs
Only the structurally appropriate tabular optimizer track was tested. Larger models, longer training, vision/sequence/dynamics tracks, full Muon, and FLOP-normalized speed analysis were not tested.
How to run: python3 bench_polar_muon.py
Verdict computed by deterministic test code from paired-seed statistics — not by the language model.
Stage 2 — Benchmark latest Failed ✗
Agent confidence: 9/10
Built a matched tabular MLP benchmark comparing AdamW with an orthogonality penalty against Polar-Muon Stiefel updates on two hidden weight matrices. The trained-model tangent residual and polar-oracle error were near numerical zero, but the idea lost on all 8 paired seeds with significantly higher test MSE; the mechanism works while the optimization benefit does not transfer.
- Baseline
- AdamW plus orthogonality penalty; best lr=0.01, penalty=0.1; mean test MSE 4.6294, std 0.6820
- Comparison
- paired delta idea-baseline = +3.9540 MSE; idea wins 0/8; permutation p=0.0081; idea worse significant
- Idea
- Polar-Muon; best lr=0.01, beta=0.9; mean test MSE 8.5834, std 0.6603
Benchmark result
Significantly WORSE than the tuned baseline (+85.4%, p=0.0081, wins 0 / 8 paired seeds).
- Benchmark
- Tabular regression (Friedman)
- Model
- mlp_tiny
- Paired seeds
- 8
- Baseline mean
- 4.6294
- Idea mean
- 0
- Effect (Δ)
- 3.954 (+85.4%; negative = idea better)
- Wins
- 0 / 8 paired seeds
- p-value
- 0.0081 (permutation test, 20 000 shuffles)
- Smallest detectable effect
- n/a
- Mechanism
- Confirmed ✓
- Practical effect
- Hurts
- Baseline tuning
- swept over 0 configs
Only the structurally appropriate tabular optimizer track was tested. Larger models, longer training, vision/sequence/dynamics tracks, full Muon, and FLOP-normalized speed analysis were not tested.
How to run: python3 bench_polar_muon.py
Artifacts
- bench_polar_muon.py 5.0 KB View Raw
- bench_report.json 5.0 KB View Raw
- experiment.py 4.6 KB View Raw
- report.md 1.5 KB View
- report_bench_2026-09-01T011357.md 2.8 KB View
- results.json 24.0 KB View Raw