Language Models as Implicit Tree Search

Despite advancing language model (LM) alignment, direct preference optimization (DPO) falls short in LM reasoning with the free lunch from reinforcement learning (RL). As the breakthrough, this work proposes a new RL-free preference optimization method aiming to achieve DPO along with learning another LM, whose response generation policy holds the asymptotic equivalence with AlphaZero-like search, the apex of algorithms for complex reasoning missions like chess Go. While circumventing explicit value and reward modeling, the neural implicit tree search executed by the extra LM remains seeking to equip DPO with reasoning procedure technically akin to AlphaZero. Our experiments demonstrate that our methodology outperforms both regular DPO variants in human preference alignment, and MCTS-based LMs in mathematical reasoning and planning tasks.

Authors

• Ziliang Chen 0001
• Zhao-Rong Lai
• Yufeng Yang
• Liangda Fang
• Zhanfu Yang
• Liang Lin

Keywords

• RL-free preference optimization; LLM based MCTS; LLM alignment;LLM reasoning