Monte Carlo Tree Search Boosts Reasoning via Iterative Preference Learning
<|reference_start|>Monte Carlo Tree Search Boosts Reasoning via Iterative Preference Learning: We introduce an approach aimed at enhancing the reasoning capabilities of Large Language Models (LLMs) through an iterative preference learning process inspired by the successful strategy employed by AlphaZero. Our work leverages Monte Carlo Tree Search (MCTS) to iteratively collect preference data, utilizing its look-ahead ability to break down instance-level rewards into more granular step-level signals. To enhance consistency in intermediate steps, we combine outcome validation and stepwise self-evaluation, continually updating the quality assessment of newly generated data. The proposed algorithm employs Direct Preference Optimization (DPO) to update the LLM policy using this newly generated step-level preference data. Theoretical analysis reveals the importance of using on-policy sampled data for successful self-improving. Extensive evaluations on various arithmetic and commonsense reasoning tasks demonstrate remarkable performance improvements over existing models. For instance, our approach outperforms the Mistral-7B Supervised Fine-Tuning (SFT) baseline on GSM8K, MATH, and ARC-C, with substantial increases in accuracy to $81.8\%$ (+$5.9\%$), $34.7\%$ (+$5.8\%$), and $76.4\%$ (+$15.8\%$), respectively. Additionally, our research delves into the training and inference compute tradeoff, providing insights into how our method effectively maximizes performance gains. Our code is publicly available at https://github.com/YuxiXie/MCTS-DPO.<|reference_end|>
@article{xie2024monte,
    title={Monte Carlo Tree Search Boosts Reasoning via Iterative Preference
  Learning},
    author={Yuxi Xie, Anirudh Goyal, Wenyue Zheng, Min-Yen Kan, Timothy P.
  Lillicrap, Kenji Kawaguchi, Michael Shieh},
    journal={arXiv preprint arXiv:2405.00451},
    year={2024},
    archivePrefix={arXiv},
    eprint={2405.00451},
    primaryClass={cs.AI cs.LG}
}