Mechanism

Allows an SFT model to improve without any additional human preference data or external reward model via a two-player minimax game: at iteration tt, the opponent (old policy πθt\pi_{\theta_t}) generates synthetic responses y′∼πθt(⋅∣x)y' \sim \pi_{\theta_t}(\cdot\mid x), while the main player πθt+1\pi_{\theta_{t+1}} is trained via a DPO-like logistic loss to assign higher likelihood to real human SFT demonstrations yreal∼pdatay_{\text{real}} \sim p_{\text{data}} than to its own previous self-generated outputs y′y', converging when πθ=pdata\pi_\theta = p_{\text{data}}.

Practical Notes

Extracts substantial extra capability from a fixed SFT dataset after standard 1–2 epoch SFT has saturated.

References

  1. Self-Play Fine-Tuning Converts Weak Language Models to Strong Language Models ↗

    Zixiang Chen, Yihe Deng, Huizhuo Yuan, Kaixuan Ji, Quanquan Gu · 2024