Proximal Supervised Fine-Tuning

Abstract

Supervised fine-tuning (SFT) of foundation models often leads to poor generalization, where prior capabilities deteriorate after tuning on specific tasks. Inspired by trust-region policy optimization (TRPO) and proximal policy optimization (PPO) in reinforcement learning (RL), we propose Proximal SFT (PSFT), a fine-tuning objective that 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, human-value, and multimodal domains show that PSFT matches standard 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.

Cite

Text

Zhu et al. "Proximal Supervised Fine-Tuning." International Conference on Learning Representations, 2026.

Markdown

[Zhu et al. "Proximal Supervised Fine-Tuning." International Conference on Learning Representations, 2026.](https://mlanthology.org/iclr/2026/zhu2026iclr-proximal/)

BibTeX

@inproceedings{zhu2026iclr-proximal,
  title     = {{Proximal Supervised Fine-Tuning}},
  author    = {Zhu, Wenhong and Xie, Ruobing and Wang, Rui and Sun, Xingwu and Wang, Di and Liu, Pengfei},
  booktitle = {International Conference on Learning Representations},
  year      = {2026},
  url       = {https://mlanthology.org/iclr/2026/zhu2026iclr-proximal/}
}