The Sparsity Puzzle of RLVR
When reinforcement learning improves a model's reasoning and coding abilities, the parameter updates turn out to be extremely sparse — like a pianist playing a masterpiece by moving only her pinky finger. RLVR is a paradox: a costly, high-reward training process that changes only a tiny fraction of parameters. This sparsity is not random; it is determined by the model's intrinsic geometry. In contrast, SFT updates are dense.
The Three-Gate Theory
The sparsity of RLVR can be explained by three consecutive constraints ("gates") on parameter updates:
1. Gate 1: KL Anchor — RL induces a single-step policy-KL constraint that keeps updates close to the base policy, limiting the magnitude of parameter changes. 2. Gate 2: Model Geometry — Updates are steered toward low-curvature, spectrum-preserving directions. This is a data-invariant property that forces the model to avoid the "principal directions." 3. Gate 3: Precision — bfloat16 format acts as a lens that hides micro-updates, making the underlying pattern manifest as clear sparsity.
Ridge vs. Valley: A Geometric Metaphor
SFT and RLVR take completely different paths through parameter space:
- Ridge (SFT path): Climbing steep, high-curvature "principal directions," causing dramatic spectral drift and altering the model's core knowledge structure.
- Valley (RLVR path): Hiking through gentle "off-principal" valleys, preserving the core knowledge structure and enabling efficient, safe learning.
- LoRA is naturally suited to RL. It naturally updates non-principal directions, matching RLVR's "valley path." Learning in a low-rank space without disturbing the core geometry lets it stably improve reasoning.
- PiSSA is the "mountaineer" in RL. PiSSA focuses on updating the principal singular directions — forcing the model up the ridge. In RL tasks this violates RLVR's basic optimization principles and leads to training collapse.