Monte Carlo Tree Search with Boltzmann Exploration
<|reference_start|>Monte Carlo Tree Search with Boltzmann Exploration: Monte-Carlo Tree Search (MCTS) methods, such as Upper Confidence Bound applied to Trees (UCT), are instrumental to automated planning techniques. However, UCT can be slow to explore an optimal action when it initially appears inferior to other actions. Maximum ENtropy Tree-Search (MENTS) incorporates the maximum entropy principle into an MCTS approach, utilising Boltzmann policies to sample actions, naturally encouraging more exploration. In this paper, we highlight a major limitation of MENTS: optimal actions for the maximum entropy objective do not necessarily correspond to optimal actions for the original objective. We introduce two algorithms, Boltzmann Tree Search (BTS) and Decaying ENtropy Tree-Search (DENTS), that address these limitations and preserve the benefits of Boltzmann policies, such as allowing actions to be sampled faster by using the Alias method. Our empirical analysis shows that our algorithms show consistent high performance across several benchmark domains, including the game of Go.<|reference_end|>
@article{painter2024monte,
    title={Monte Carlo Tree Search with Boltzmann Exploration},
    author={Michael Painter, Mohamed Baioumy, Nick Hawes, Bruno Lacerda},
    journal={Advances in Neural Information Processing Systems 36 (2024)},
    year={2024},
    archivePrefix={arXiv},
    eprint={2404.07732},
    primaryClass={cs.AI cs.LG}
}