English

Blending Supervised and Reinforcement Fine-Tuning with Prefix Sampling

Machine Learning 2026-05-18 v3 Artificial Intelligence Computation and Language

Abstract

Existing LLMs-post-training techniques are broadly categorized into supervised fine-tuning (SFT) and reinforcement fine-tuning (RFT). Each paradigm presents a distinct trade-off: (1) SFT excels at mimicking demonstration data, but can lead to problematic generalization as a form of behavior cloning. (2) Conversely, RFT can significantly enhance a model's performance but is prone to learning unexpected behaviors, and its performance is sensitive to the initial policy. In this paper, we propose a unified view of these methods and introduce Prefix-RFT, a hybrid approach that synergizes learning from both demonstration and exploration. Using mathematical reasoning problems as a test bed, we empirically demonstrate that Prefix-RFT is simple yet effective. Not only does it surpass the performance of standalone SFT and RFT, but it also outperforms parallel mixed-policy RFT methods. Our analysis highlights the complementary nature of SFT and RFT, validating that Prefix-RFT effectively harmonizes them. Further ablation studies confirm the method's robustness to variations in the quality and quantity of demonstration data.

Keywords

Cite

@article{arxiv.2507.01679,
  title  = {Blending Supervised and Reinforcement Fine-Tuning with Prefix Sampling},
  author = {Zeyu Huang and Tianhao Cheng and Zihan Qiu and Zili Wang and Yinghui Xu and Edoardo M. Ponti and Ivan Titov},
  journal= {arXiv preprint arXiv:2507.01679},
  year   = {2026}
}

Comments

ICML 2026

R2 v1 2026-07-01T03:43:11.678Z