ISO: An RLVR-Native Optimization Stack

Inherit the spectrum, optimize the frames.

Hanqing Zhu1*, Wenyan Cong1*, Zhizhou Sha1, Sagnik Mukherjee2, Xinyuan Song3, David González-Martínez6, Xiaoxia Wu4, Yuandong Tian5, Shiwei Liu6, David Z. Pan1, Zhangyang "Atlas" Wang1†

1The University of Texas at Austin   2UIUC   3Emory University   4Together AI   5Recursive Superintelligence Inc   6ELLIS Institute Tübingen

*Equal contribution  ·  Corresponding author

From spectral inheritance to Isospectral Optimization: RLVR keeps the base spectrum while both singular frames move; ISO-Merger composes experts offline and ISO-Optimizer trains online in fixed-spectrum coordinates.
Teaser figure placeholder.
Export Figure 1 from the paper PDF and save it as static/images/teaser.png
(e.g. pdftoppm -png -r 220 -f 2 -l 2 ISO_arxiv.pdf, then crop the figure).

From spectral inheritance to Isospectral Optimization. Unconstrained RLVR changes both singular frames while the weight spectra stay close to their base values — and restoring the base spectrum Σ0 costs almost nothing. ISO turns this regularity into an inductive bias: reuse Σ0, optimize (U, V) — offline as ISO-Merger and online as ISO-Optimizer.

TL;DR RLVR barely rewrites the base model's singular-value spectra — the new capability lives in the singular frames. We verify this functionally (you can put the base spectrum back, or never let it move, and keep the gains), and turn it into ISO, a fixed-spectrum optimization stack: ISO-Merger composes shared-base RL experts with no data, rollouts, gradients, or distillation, and ISO-Optimizer runs AdamW/Muon on the frames and reaches matched RLVR accuracy with up to 2.7× fewer training steps.
Observation → Function

Spectra stay: spectral inheritance in RLVR

Write each weight matrix as W = U Σ V: the spectrum Σ sets the scale of each singular mode, the frames (U, V) set its output/input directions. Across RLVR runs — including a public reasoning run trained for 3,000+ updates — the learned checkpoint sits strikingly close to the fixed-spectrum family of its base weights: the spectral residual is only ≈3% of the total weight displacement, versus ≈35% for a comparable SFT transition. SFT reshapes the spectrum; RLVR doesn't need to.

Proximity alone could be a high-dimensional accident, so we test it functionally, with interventions in both directions: restore the base spectrum after training, or never let it move at all.

Takeaway 1 — Spectral inheritance. RLVR can reuse the base model's weight spectra rather than rewrite them: restoring the base spectrum in the RL-trained frames preserves the gains, and training with the spectrum frozen from step one still learns strongly. The acquired behavior lives in the frames.

The rebase experiment, interactive

Take an RLVR checkpoint (DeepSeek-R1-Distill-Qwen-1.5B → Nemotron-Research-Reasoning-Qwen-1.5B), keep its learned frames (URL, VRL) fixed, and interpolate only the spectrum between the base model's Σ0 and the RL-trained ΣRL. At α = 0 the RL model's spectrum is fully replaced by the base spectrum. Drag the slider — the accuracy doesn't care:

Spectrum interpolation with RL-trained frames fixed
Each of the six slider stops is a separately evaluated model. Only the singular values change; the frames never move.
W̃(α)  =  URL  [ 1.00 · Σ0  +  0.00 · ΣRL ]  VRL
α = 0.0
α = 0  ·  base spectrum Σ0 restored α = 1  ·  original RL checkpoint
Average score at current α
Base model (pre-RL)
37.6
average over the 5 math benchmarks
Δ vs. full RL checkpoint
≈ 0 at every α: the spectrum change was never needed
score of W̃(α) — RL frames, interpolated spectrum base model before RLVR
Show the evaluated anchor data (Fig. 4a)
BenchmarkBaseα=0.0α=0.2α=0.4α=0.6α=0.8α=1.0 (RL)

Restoring the base spectrum preserves RLVR's gains at every α. A spectrum-only parameterization (frames frozen, singular values trainable) likewise fails to learn comparably — what RLVR needs to change is the frames.

The mirror test: graft the RL spectrum into the SFT frames

Run the same interpolation in the opposite direction: fix the frames of the SFT model (USFT, VSFT) and blend the spectrum toward the RL-trained ΣRL. If RLVR's gains lived in the spectrum, scores should climb toward the RL checkpoint as α grows. They don't move at all:

Spectrum interpolation with SFT frames fixed (mirror control)
Each of the six slider stops is a separately evaluated model. The dashed marks show the full RL checkpoint — the bars never approach them.
W̃(α)  =  USFT  [ 1.0 · ΣSFT  +  0.0 · ΣRL ]  VSFT
α = 0.0
α = 0  ·  original SFT model α = 1  ·  SFT frames + full RL spectrum
Average score at current α
Full RL checkpoint
46.0
average over the same 7 benchmarks
Δ vs. RL checkpoint
the RL spectrum alone buys none of the gains
score of W̃(α) — SFT frames, interpolated spectrum full RL checkpoint (Nemotron, ~3k RLVR updates)
Show the evaluated anchor data
BenchmarkRL ckptα=0.0α=0.2α=0.4α=0.6α=0.8α=1.0

The RL spectrum in SFT frames buys nothing — at any mixing ratio. All 7 metrics stay pinned at the SFT level (α-sweep range ≤ 3.2pp, within Mean@n sampling noise; the α=0 endpoint reproduces the original SFT model to ≤ 0.8pp). The spectra themselves barely differ — relative drift ‖ΔΣ‖/‖Σ‖ ≤ 0.04% across all 198 matrices. Together with the panel above, the evidence runs in both directions: useful RLVR progress is carried by singular-frame motion, not by spectral rescaling.

Structure

Frames move — and both must stay adaptable

If the spectrum can be inherited, which variables must remain free? We reconstruct RL endpoints under four structural restrictions and measure how much of the checkpoint update each one fails to explain (two-stage VLA RL pipeline, transition W0 → W2, median across layers):

Remix within both incoming subspaces (umix) 87%
Freeze output subspace only (uL) 45%
Freeze input subspace only (uR) 42%
Fix the spectrum, adapt both frames (uiso) 1.8%

Fraction of the checkpoint update left unexplained by the best reconstruction in each class (lower is better; 100% = no change explained). The same pattern recurs across sequential RL stages with distinct objectives.

Takeaway 2 — Fix the spectrum, keep both frames adaptable. Even permissive remixing inside the incoming subspaces, or freezing just one side, leaves a large share of the update unexplained. Retaining the incoming spectrum while adapting both frames leaves only ~2% — directly motivating ISO's parameterization W(U,V) = U Σ0 V.
Method

ISO: Isospectral Optimization

Inherit the spectrum, optimize the frames:  W(U, V) = U Σ0 V,  U, V on the Stiefel manifold.

U — output frame · moves
×
σ1 σ2 σq
Σ0 — base spectrum · frozen
×
V — input frame · moves

The tangent space TUt rides along the trajectory: at each step the base optimizer takes a tentative update in the tangent plane, and the polar retraction puts the iterate back on the manifold — so every Wt = Ut Σ0 Vt keeps the base spectrum exactly.

Every represented matrix shares the base spectrum Σ0 exactly; all learning and composition happen in the frame coordinates, with a polar retraction restoring orthonormality. ISO is a stack, not a single optimizer — one principle, two instantiations spanning the RLVR workflow:

Offline

ISO-Merger — compose RL experts without rollouts

Take specialists trained from a shared base, express each expert as a displacement of the singular frames (project → mask trailing modes → solve unit-retention coefficients → retract), and rebuild one fixed-spectrum model.

No post-merge data, rollouts, gradient updates, or on-policy distillation.
Online

ISO-Optimizer — fixed-spectrum RLVR training

Apply your existing optimizer — AdamW or Muon, states and all — to (U, V) instead of W, keep Σ0 frozen, and retract after each step — a strictly more constrained model class.

Fewer training steps, higher rewards.
Results · Offline

ISO-Merger: data-free expert composition

Merging RLVR specialists in fixed-spectrum frame coordinates recovers their complementary capabilities — with zero post-merge compute. Recovery of each specialist's own score by the single merged model:

Qwen2.5-7B-Instruct — 3 RL experts
Coding 106.2%
Tool use 99.8%
Memory 99.5%
DeepSeek-R1-Distill-Qwen-1.5B — 2 RL experts
Coding 101.4%
Math 101.7%

Recovery of specialist score (%); the vertical mark is 100% = the original specialist itself.

Qwen2.5-7B-Instruct · coding + tool-use + memory experts

Method LiveBenchLCB v2 Tool Use (BFCL) HotpotQASQuAD Avg
ACCUTACCUT LiveNon-Live 32K64K32K64K
Base (Qwen2.5-7B-Instruct)36.2548.2728.3143.0862.9669.2649.8745.5458.9056.7749.92
RLVR-Coder37.4249.4230.1744.2463.3768.0750.2145.6160.5156.8450.59
RLVR-Tool36.8748.0828.2042.4371.8381.8250.3945.3359.7357.8652.25
RLVR-Memory37.3250.0527.4141.7063.8272.6178.6077.9579.9878.5260.80
Task Arithmetic38.8552.1831.5547.0673.7382.8672.2270.4975.0374.9561.89
TIES40.3052.0431.4647.3368.2476.5476.4275.2478.2777.8662.37
TSV36.9649.2328.9243.3773.6482.6975.3774.1078.3077.2661.98
RAM38.5950.3831.3146.3372.5681.8976.1775.2978.4277.8362.88
OrthoMerge-G-TIES40.7453.2231.9847.4866.9878.1774.7974.2077.7576.3262.16
ISO-Merger (ours)41.8152.7331.0645.6972.3281.0779.4676.7779.1078.0163.80

Means over 3 independent stochastic evaluation runs (standard deviations in the paper). Expert rows shaded blue; bold marks the best expert and the best merged result per column.

DeepSeek-R1-Distill-Qwen-1.5B · coding + math experts

Method LiveBenchLCB v5 AIME24AIME25AMC23MinervaOlympiad Avg
ACCUTACCUT@32@32@8@4@4
Base (DS-R1-Distill-1.5B)17.9926.2416.8220.8530.9023.4063.1527.3343.1129.98
Archer2.0 (coding)26.6637.2626.9038.9942.0528.0273.4430.0949.9939.27
JustRL (math)22.2331.8523.0530.1853.1636.8482.7834.7155.6741.16
Task Arithmetic26.2235.8226.7036.5850.8333.0980.8233.0054.3141.93
TIES26.3736.7527.6239.4554.5135.7682.1333.7655.3643.52
TSV26.4036.8327.6140.0153.1635.1780.9733.8854.6843.19
RAM26.7136.9927.1838.8354.2035.8082.2834.1055.5443.51
OrthoMerge-G-TIES26.4636.7327.7439.8654.5535.1481.8833.5555.4743.49
ISO-Merger (ours)25.5236.4227.8441.8455.0037.8183.5334.7756.6444.38

ISO-Merger achieves the strongest aggregate performance among the compared data-free merging methods on both backbones, and improves worst@4 by 1.62 / 1.36 points — more consistent capability recovery, not just a better mean.

Results · Online

ISO-Optimizer: same reward signal, fewer steps, higher accuracy

ISO-AdamW uses a single learning rate everywhere (7.5×10−7), while the weight-space baselines get a full learning-rate sweep. On Qwen3-8B-Base, ISO-AdamW reaches AdamW's 270-step accuracy by step 100 — ≈2.7× fewer training steps — and keeps improving to 0.509 vs. 0.495:

Math accuracy on Qwen3-8B-Base: ISO-AdamW stays above AdamW throughout and reaches AdamW's final accuracy 2.7 times earlier.

Qwen3-8B-Base, DeepMath-103K. Aggregate average@16 over AIME24/25, AMC23, Minerva, OlympiadBench. Extending AdamW 60 more steps yields no further gain — the gap is not under-training.

Qwen3-1.7B-Base: ISO-AdamW vs a five-way AdamW learning-rate sweep.

Qwen3-1.7B-Base — highest final aggregate accuracy vs. the full AdamW sweep.

Qwen3-4B-Base: ISO-AdamW matches the best AdamW final accuracy with about 2.2x fewer steps.

Qwen3-4B-Base — matches the best AdamW with ≈2.2× fewer steps, then keeps improving.

Qwen3-4B-Base with Muon: ISO-Muon reaches the best Muon accuracy with 1.4x fewer steps.

ISO-Muon — the construction transfers across base optimizers: ≈1.4× fewer steps than tuned Muon.

Coding on DeepSeek-R1-Distill-Qwen-1.5B: ISO-AdamW leads tuned AdamW on LiveCodeBench.

Coding (DS-1.5B, ArcherCodeR) — leads tuned AdamW on LiveCodeBench; extended baselines never match its peak.

Math RLVR (average@16, DeepMath-103K)

ModelMethodAIME24AIME25AMC23MinervaOlympiadAvg
Qwen3-1.7B-BaseBase3.751.2523.0418.4918.4312.99
AdamW13.9612.9243.4532.1739.2528.35
Muon16.258.3343.6032.2438.0627.70
ISO-AdamW (ours)16.0411.0444.5033.1139.0128.74
Qwen3-4B-BaseBase6.885.0025.4520.9722.4316.15
AdamW25.2120.4263.5545.4053.8741.69
Muon25.4219.5863.6346.5156.0242.23
ISO-AdamW (ours)27.2923.1365.7445.1555.9943.46

Checkpoint with the highest aggregate score among the final three evaluations, per run. Baselines use the best learning rate from their sweep.

Competitive coding (average@8, LiveCodeBench, 220 steps)

MethodLCB v5LCB v6Avg
DS-R1-Distill-1.5B17.4318.4117.92
AdamW24.0126.2425.13
ISO-AdamW (ours)25.4926.9126.20

Overhead: the FP64 SVD polar retraction adds ≈86 s per actor update on Qwen3-4B — only ≈7% of end-to-end RL step time, and amenable to overlap with rollout generation in asynchronous RL systems.

Reference

Citation

@article{zhu2026iso,
  title         = {ISO: An RLVR-Native Optimization Stack},
  author        = {Zhu, Hanqing and Cong, Wenyan and Sha, Zhizhou and Mukherjee, Sagnik and
                   Song, Xinyuan and Gonz{\'a}lez-Mart{\'i}nez, David and Wu, Xiaoxia and
                   Tian, Yuandong and Liu, Shiwei and Pan, David Z. and Wang, Zhangyang},
  journal       = {arXiv preprint arXiv:2607.19331},
  year          = {2026},
  eprint        = {2607.19331},
  archivePrefix = {arXiv},
  primaryClass  = {cs.LG},
  url           = {https://arxiv.org/abs/2607.19331}
}