English

Proximal Supervised Fine-Tuning

Machine Learning 2026-04-14 v2 Artificial Intelligence Computation and Language

Abstract

Supervised fine-tuning (SFT) of foundation models often leads to poor generalization, where prior capabilities deteriorate after tuning on new tasks or domains. Inspired by trust-region policy optimization (TRPO) and proximal policy optimization (PPO) in reinforcement learning (RL), we propose Proximal SFT (PSFT). This fine-tuning objective incorporates the benefits of trust-region, effectively constraining policy drift during SFT while maintaining competitive tuning. By viewing SFT as a special case of policy gradient methods with constant positive advantages, we derive PSFT that stabilizes optimization and leads to generalization, while leaving room for further optimization in subsequent post-training stages. Experiments across mathematical and human-value domains show that PSFT matches SFT in-domain, outperforms it in out-of-domain generalization, remains stable under prolonged training without causing entropy collapse, and provides a stronger foundation for the subsequent optimization.

Keywords

Cite

@article{arxiv.2508.17784,
  title  = {Proximal Supervised Fine-Tuning},
  author = {Wenhong Zhu and Ruobing Xie and Rui Wang and Xingwu Sun and Di Wang and Pengfei Liu},
  journal= {arXiv preprint arXiv:2508.17784},
  year   = {2026}
}

Comments

ICLR 2026

R2 v1 2026-07-01T05:04:12.409Z