Mechanism

Instead of contrasting two complete responses (yw,yl)(y_w, y_l) that share many valid early reasoning steps, identifies the exact first erroneous reasoning step skls_k^l vs. a verified continuation step skws_k^w given the shared valid prefix (x,s1:k−1)(x, s_{1:k-1}) (using Monte Carlo rollouts, MCTS, or a process judge) and applies DPO solely on the diverging step: LStep-DPO(θ)=−E(x,s1:k−1,skw,skl)[log⁡σ(βlog⁡πθ(skw∣x,s1:k−1)πref(skw∣x,s1:k−1)−βlog⁡πθ(skl∣x,s1:k−1)πref(skl∣x,s1:k−1))]\mathcal{L}_{\text{Step-DPO}}(\theta) = -\mathbb{E}_{(x, s_{1:k-1}, s_k^w, s_k^l)}\left[\log \sigma\left(\beta \log \frac{\pi_\theta(s_k^w\mid x, s_{1:k-1})}{\pi_{\text{ref}}(s_k^w\mid x, s_{1:k-1})} - \beta \log \frac{\pi_\theta(s_k^l\mid x, s_{1:k-1})}{\pi_{\text{ref}}(s_k^l\mid x, s_{1:k-1})}\right)\right]

Practical Notes

Prevents DPO from inadvertently penalizing valid prefix steps that happen to precede a late calculation error in yly_l.

References

  1. Step-DPO: Step-wise Preference Optimization for Long-chain Reasoning of LLMs ↗

    Xin Lai, Zhuotao Tian, Yukang Chen, Senqiao Yang, Xiangru Peng, Jiaya Jia · 2024

  2. Monte Carlo Tree Search Boosts Reasoning via Iterative Preference Learning ↗

    Yuxi Xie, Anirudh Goyal, Wenyue Zheng, Min-Yen Kan, Timothy P. Lillicrap, Kenji Kawaguchi et al. · 2024

    All 7 authors

    Yuxi Xie, Anirudh Goyal, Wenyue Zheng, Min-Yen Kan, Timothy P. Lillicrap, Kenji Kawaguchi, Michael Shieh

  3. Phi-4 Technical Report ↗

    Marah Abdin, Jyoti Aneja, Harkirat Behl, Sébastien Bubeck, Ronen Eldan, Suriya Gunasekar et al. · 2024

    All 27 authors

    Marah Abdin, Jyoti Aneja, Harkirat Behl, Sébastien Bubeck, Ronen Eldan, Suriya Gunasekar, Michael Harrison, Russell J. Hewett, Mojan Javaheripi, Piero Kauffmann, James R. Lee, Yin Tat Lee, Yuanzhi Li, Weishung Liu, Caio C. T. Mendes, Anh Nguyen, Eric Price, Gustavo de Rosa, Olli Saarikivi, Adil Salim, Shital Shah, Xin Wang, Rachel Ward, Yue Wu, Dingli Yu, Cyril Zhang, Yi Zhang