Mechanism
Instead of contrasting two complete responses that share many valid early reasoning steps, identifies the exact first erroneous reasoning step vs. a verified continuation step given the shared valid prefix (using Monte Carlo rollouts, MCTS, or a process judge) and applies DPO solely on the diverging step:
Practical Notes
Prevents DPO from inadvertently penalizing valid prefix steps that happen to precede a late calculation error in .
References
- Step-DPO: Step-wise Preference Optimization for Long-chain Reasoning of LLMs ↗
- Monte Carlo Tree Search Boosts Reasoning via Iterative Preference Learning ↗
All 7 authors
Yuxi Xie, Anirudh Goyal, Wenyue Zheng, Min-Yen Kan, Timothy P. Lillicrap, Kenji Kawaguchi, Michael Shieh
- Phi-4 Technical Report ↗
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