Same Targets, Different Computation: How Post-Training Divides Work Across Model Layers
Not on the map. Why?
Abstract (arXiv)
A late-layer change learned during post-training may work on the base model's earlier state, or it may depend on earlier computation learned with it. We distinguish these cases with a four-cell diagnostic that crosses base or descendant upstream states with base or descendant late stacks. A large late-stack effect need not imply strong upstream dependence. On math prompts, OpenMath2's late stack changes the target margin by +3.43 logits after base upstream state and +3.28 after its own, giving a near-zero interaction. Several instruction-following descendants of the same Llama-3.1-8B base show greater dependence, while controlled code and biomedical continuation-training runs sit near zero on the common support; seven released descendants span -0.54 to +2.20 logits. Because those checkpoints differ in many ways, we then isolate one training property. Two LoRA fine-tunes learn identical target responses requested either by familiar natural-language instructions or by newly learned nonce codes. Changing only this cue-to-response relation increases upstream dependence by +5.56 logits on Qwen3-4B and +4.18 on Llama-3.1-8B, with a positive paired shift in all six model-by-seed runs. The interaction is also positive in all five released base/instruction pairs we test, and late-stack replacement changes the full-vocabulary argmax in about half of events. Post-training can therefore organize the same target behavior with different dependencies between earlier and later computation. The diagnostic measures local next-token compatibility, not free-running component transplantation.
Key facts. No citing papers in the map yet (data through 7 Oct 2026). Builds on 20 of its 22 references that are in the map. First posted on arXiv 8 May 2026.
Builds on
20 of 22 references.
References · 20
- 2024The Llama 3 Herd of Modelscited by 14,192
- 2021LoRA: Low-Rank Adaptation of Large Language Modelscited by 14,084
- 2021Training Verifiers to Solve Math Word Problemscited by 9,743
- 2025Qwen3 Technical Reportcited by 8,195
- 2023Direct Preference Optimization: Your Language Model is Secretly a Reward Modelcited by 7,916
- 2020Measuring Massive Multitask Language Understandingcited by 7,768
- 2024Qwen2.5 Technical Reportcited by 4,713
- 2023Mistral 7Bcited by 3,065
- 2023Instruction-Following Evaluation for Large Language Modelscited by 1,143
- 2024Tulu 3: Pushing Frontiers in Open Language Model Post-Trainingcited by 988
- 2024Refusal in Language Models Is Mediated by a Single Directioncited by 960
- 20242 OLMo 2 Furiouscited by 302
8 more
- 2024OpenMathInstruct-2: Accelerating AI for Math with Massive Open-Source Instruction Datacited by 194
- 2024How to use and interpret activation patchingcited by 191
- 2024Fine-Tuning Enhances Existing Mechanisms: A Case Study on Entity Trackingcited by 140
- 2023Is This the Subspace You Are Looking for? An Interpretability Illusion for Subspace Activation Patchingcited by 75
- 2024Hermes 3 Technical Reportcited by 33
- 2025Overcoming Sparsity Artifacts in Crosscoders to Interpret Chat-Tuningcited by 31
- 2025How Post-Training Reshapes LLMs: A Mechanistic View on Knowledge, Truthfulness, Refusal, and Confidencecited by 12
- 2026Patches of Nonlinearity: Instruction Vectors in Large Language Modelscited by 1
Built on by
Not cited yet.