On-Policy Parameter Update Direction Underlies Generalization in LLM Post-Training
cs.LG
Submitted: 2026-09-29
Updated: 2026-09-29
Code: https://github.com/ssfgunner/OPSFT
License: http://creativecommons.org/licenses/by-nc-sa/4.0/
The gist: The strong generalization performance of on-policy post-training paradigms has motivated studies of their parameter update behaviors.
Terminology
Abstract
The strong generalization performance of on-policy post-training paradigms has motivated studies of their parameter update behaviors. However, these studies treat the observed behaviors only as byproducts in on-policy training, overlooking their potential to serve as optimization principles for improving the generalization of other paradigms such as supervised fine-tuning (SFT). To address this limitation, we investigate whether there exists a specific on-policy update behavior that can achieve such improvements. First, our analyses reveal that SFT updates parameters along consistent directions, while the on-policy paradigm continuously adjusts the direction during training. This difference inspires us to focus on the cumulative update direction of each parameter as a promising behavior. Then, we evaluate its effectiveness for improving generalization by proposing On-Policy direction-constrained Supervised Fine-Tuning (OPSFT), which constrains SFT updates to the direction identified by on-policy paradigms. The strong performance of OPSFT indicates that the generalization advantage of on-policy paradigms can be transferred to SFT through the parameter update direction. Once such a direction is identified, even SFT can generalize with its updates constrained to this direction. This finding offers two practical benefits by combining the strong generalization of on-policy paradigms with the advantages of SFT, including the high training efficiency and ability to leverage high-quality trajectories. For efficiency, we identify update directions that support strong generalization using a few on-policy training steps, and subsequently apply OPSFT to achieve high training efficiency. For leveraging high-quality trajectories, OPSFT can utilize these trajectories to continue improving a post-trained model along its update direction without disrupting the ability learned from on-policy training.
Sources
- Scaling Sparse Fine-Tuning to Large Language Models
- SFT Memorizes, RL Generalizes: A Comparative Study of Foundation Model Post-training
- Think you have Solved Question Answering? Try ARC, the AI2 Reasoning Challenge
- Process Reinforcement through Implicit Rewards
- Weight-sparse transformers have interpretable circuits
- DeepSeek-R1: Incentivizing Reasoning Capability in LLMs via Reinforcement Learning
- Distilling the Knowledge in a Neural Network
- Reasoning Path Divergence: A New Metric and Curation Strategy to Unlock LLM Diverse Thinking
- HaluEval: A Large-Scale Hallucination Evaluation Benchmark for Large Language Models
- The Reasoning Boundary Paradox: How Reinforcement Learning Constrains Language Models
- Supervised Fine Tuning on Curated Data is Reinforcement Learning (and can be improved)
- Rethinking Generalization in Reasoning SFT: A Conditional Analysis on Optimization, Data, and Model Capability
- DeepSeekMath: Pushing the Limits of Mathematical Reasoning in Open Language Models
- On the Geometry of On-Policy Distillation
- The Invisible Leash: Why RLVR May or May Not Escape Its Origin
- MiMo: Unlocking the Reasoning Potential of Language Model -- From Pretraining to Posttraining
- Qwen3 Technical Report
- Learning beyond Teacher: Generalized On-Policy Distillation with Reward Extrapolation
- Dense Supervision, Sparse Updates: On the Sparsity and Geometry of On-Policy Distillation
- 100 Days After DeepSeek-R1: A Survey on Replication Studies and More Directions for Reasoning Language Models
Related papers
- Polynomial-Augmented Neural Networks (PANNs) with Weak Orthogonality Constraints for Enhanced Function and PDE Approximation
- AIRL-S: Unifying Reinforcement Learning and Search-Based Test-Time Scaling via Adversarial Inverse Reinforcement Learning
- Transformers as Bayesian In-Context Experimenters: Smoothness-Adaptive Efficient ATE Estimation
- Convergence issues in Relational Concept Analysis based on AOC-posets
- Beliefs Beyond Posteriors: The Predictive Cost of ELBO Binding
- Understanding Diffusion Models via Ratio-Based Function Approximation with SignReLU Networks