Mechanism

Notices that at inference time, decoding is governed by the policy's own length-normalized log-likelihood 1∣y∣log⁡πθ(y∣x)\frac{1}{|y|}\log \pi_\theta(y\mid x), whereas DPO optimizes the unnormalized log-ratio against πref\pi_{\text{ref}}. SimPO drops πref\pi_{\text{ref}} entirely and optimizes the length-normalized average log-probability with a strict target reward margin γ>0\gamma > 0: LSimPO(θ)=−E(x,yw,yl)[log⁡σ(β∣yw∣log⁡πθ(yw∣x)−β∣yl∣log⁡πθ(yl∣x)−γ)]\mathcal{L}_{\text{SimPO}}(\theta) = -\mathbb{E}_{(x,y_w,y_l)}\left[\log \sigma\left(\frac{\beta}{|y_w|}\log \pi_\theta(y_w\mid x) - \frac{\beta}{|y_l|}\log \pi_\theta(y_l\mid x) - \gamma\right)\right]

Practical Notes

Saves 50% forward-pass compute vs. DPO (no πref\pi_{\text{ref}}) and strongly curbs verbosity inflation on AlpacaEval 2.0 and Arena-Hard.

References

  1. SimPO: Simple Preference Optimization with a Reference-Free Reward ↗

    Yu Meng, Mengzhou Xia, Danqi Chen · 2024