Skip to content

Context-Grounding Gains Are Mediated by Pre-existing Machinery: Auditing GRPO, SFT, and DPO

Sep 2026 · 0 citations · 59 references
Computer Science

TL;DR

This work compares nine post-training arms spanning GRPO, SFT, and DPO from one starting checkpoint, with key comparisons extended across scales and families.

Abstract

Language models can ignore prompt evidence when it conflicts with memorized knowledge. Post-training can make models follow such evidence more reliably, but it is unclear whether these gains require new machinery or strengthen machinery already present. We compare nine post-training arms spanning GRPO, SFT, and DPO from one starting checkpoint, with key comparisons extended across scales and families. We estimate a grounding direction from that checkpoint before training. Across five tested GRPO variants, grounding gains are small. For the two variants replicated across seeds, equivalence tests bound their effects below the conflict-SFT gain even as the rewarded metric improves. Conflict-SFT improves grounding moderately, while DPO drives grounding near ceiling on its matched distribution. Conflict-SFT and DPO largely use the same causal attention-head set as the starting model. Subtracting the starting-model direction suppresses both gains, while adding it to the starting model recovers 35% of DPO's gain at a dose passing all stated side-effect checks. After a supervised warm start makes the context answer appear in more rollouts, the same GRPO recipe adds essentially no further grounding gain. In our setting, grounding gains largely depend on machinery already present in the starting model.

View source

Similar papers

#machine learning Preprint Sep 2026

Decodable In-Context State and Model Output Across Training

This work follows probe accuracy, model output, and steering response across public pretraining and post-training checkpoints and explains why decodability on errors alone cannot establish discarded output information.

Manas Venkata Sai Ravulapalli, Samrath Singh Chadha · 0 citations
#machine learning Preprint Aug 2026

Do Language Models Know Their Own Constraints?

Comparing supervised fine tuning and Group Relative Policy Optimization against an untrained baseline on a four tier Constraint Awareness Benchmark shows the reward based signal is the more destructive of the two: a reward that penalizes banned ingredient tokens regardless of framing learns a context independent suppre...

Arin Agarwal · 0 citations
#machine learning Preprint Oct 2026

What Will Post-Training Fix? Per-Problem Gains Are Shared Across Independent RL Runs, and Existing Checkpoints Predict Them Better Than A Priori Signals

Data selection, curricula and the evaluation of post-training recipes all assume that we can tell, before training, which problems a model will improve on. We test this assumption directly. For two base models, DeepSeek-R1-Distill-Qwen-1.5B and Qwen2.5-Math-1.5B, we evaluate eighteen post-training runs on up to 1532 co...

Xiao-Xian Duan · 0 citations
#machine learning Preprint Sep 2026

How Do Language Models Choose Between Context and Memory?

The results suggest that authority computations may be task-dependent, rather than reusable across tasks, and suggest that authority computations may be task-dependent, rather than reusable across tasks.

Benjamin Shih, John Winnicki, Arianna Cao · 0 citations
#machine learning Preprint Sep 2026

RoPE at the End of Its Rope? Theory, Diagnosis, and Mitigation of Long-Context Failures

Long-context failures of RoPE-based language models can arise from RoPE's intrinsic tradeoff between maintaining stable token preferences and distinguishing nearby positions. Determining which weakness to address, and how, requires a more precise characterization of RoPE's behavior in trained models across context leng...

Yu-Yang Wu, Yu-Feng Du, Hao Peng · 0 citations
Preprint Oct 2026

Does a Learned Corrector Beat a Simple Retreat? Evidence from a Frozen VLA

Before deploying runtime recovery for a frozen vision-language-action (VLA) policy, one must establish that an intervention improves success beyond ordinary run-to-run variation and that its complexity adds value over a simple action. We evaluate these questions on frozen $\pi_{0.5}$ across four RoboTwin tasks. For eac...

Chen-Chao Sheng, Zhuang Jiang, Liu Yang et al. · 0 citations

Related blog posts

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.