GRRR: The Geometry of Reshaping, Rotation, and Routing in Decoder LLM post-training
Not on the map. Why?
Abstract (arXiv)
We study how post-training changes the weights of Large Language Models (LLMs) relative to their pretrained weights. Across 12 post-training chains with supervised fine-tuning (SFT) and reinforcement learning (RL), we express each weight update in the pretrained matrix's singular value decomposition (SVD) frame. This decomposition separates the changes of three geometrically distinct components: diagonal values, which reshapes singular values; off-diagonal values, which rotates the coupling between pretrained input and output directions; and null-space values, which routes outside the matrix's original nonzero SVD core. On a math evaluation suite, we find that removing the diagonal component usually preserves most of the gains from post-training. These results suggest that post-training gains are carried primarily by reconfiguring and extending pretrained pathways rather than by substantially changing singular values of pre-trained models.
Key facts. No citing papers in the map yet (data through 7 Oct 2026). Builds on 31 of its 35 references that are in the map. First posted on arXiv 26 Aug 2026.
Builds on
31 of 35 references.
References · 31
- 2020Language Models are Few-Shot Learnerscited by 32,199
- 2022Training language models to follow instructions with human feedbackcited by 15,712
- 2017Proximal Policy Optimization Algorithmscited by 14,441
- 2021LoRA: Low-Rank Adaptation of Large Language Modelscited by 14,084
- 2024DeepSeekMath: Pushing the Limits of Mathematical Reasoning in Open Language Modelscited by 8,851
- 2023Direct Preference Optimization: Your Language Model is Secretly a Reward Modelcited by 7,916
- 2020Scaling Laws for Neural Language Modelscited by 6,411
- 2022Emergent Abilities of Large Language Modelscited by 2,483
- 2023LIMA: Less Is More for Alignmentcited by 1,080
- 2022Editing Models with Task Arithmeticcited by 1,076
- 2024Qwen2.5-Math Technical Report: Toward Mathematical Expert Model via Self-Improvementcited by 1,057
- 2024DoRA: Weight-Decomposed Low-Rank Adaptationcited by 740
19 more
- 2025Process Reinforcement through Implicit Rewardscited by 478
- 2024PiSSA: Principal Singular Values and Singular Vectors Adaptation of Large Language Modelscited by 261
- 2018Implicit Self-Regularization in Deep Neural Networks: Evidence from Random Matrix Theory and Implications for Learningcited by 211
- 2025MiMo: Unlocking the Reasoning Potential of Language Model -- From Pretraining to Posttrainingcited by 117
- 2024LoRA vs Full Fine-tuning: An Illusion of Equivalencecited by 102
- 2025Does Math Reasoning Improve General LLM Capabilities? Understanding Transferability of LLM Reasoningcited by 101
- 2024MiLoRA: Harnessing Minor Singular Components for Parameter-Efficient LLM Finetuningcited by 89
- 2024SVFT: Parameter-Efficient Fine-Tuning with Singular Vectorscited by 57
- 2023From Language Modeling to Instruction Following: Understanding the Behavior Shift in LLMs after Instruction Tuningcited by 56
- 2025The Path Not Taken: RLVR Provably Learns Off the Principalscited by 52
- 2025Reinforcement Learning Finetunes Small Subnetworks in Large Language Modelscited by 46
- 2025SkyRL-Agent: Efficient RL Training for Multi-turn LLM Agentcited by 44
- 2020How fine can fine-tuning be? Learning efficient language modelscited by 41
- 2025Klear-Reasoner: Advancing Reasoning Capability via Gradient-Preserving Clipping Policy Optimizationcited by 39
- 2024Approaching Deep Learning through the Spectral Dynamics of Weightscited by 29
- 2025RL Fine-Tuning Heals OOD Forgetting in SFTcited by 27
- 2025Weight Spectra Induced Efficient Model Adaptationcited by 5
- 2025Understanding the Effects of Domain Finetuning on LLMscited by 4
- 2025Understanding Post-Training Structural Changes in Large Language Modelscited by 2
Built on by
Not cited yet.