New MCTS policies improve Monte Carlo Tree Search with variance awareness

Researchers have developed a new methodology called Inverse-RPO to systematically derive prior-based tree policies for Monte Carlo Tree Search (MCTS). This approach builds upon framing MCTS as a regularized policy optimization problem, offering a way to extend existing prior-free UCBs into prior-based UCTs. The new variance-aware prior-based UCTs, derived using this method, have shown superior performance compared to the standard PUCT policy across various benchmarks without increasing computational cost. An extension to the mctx library is also provided to support these new policies and encourage further research. AI

影响 Introduces novel variance-aware tree policies for MCTS, potentially improving planning efficiency in RL agents without additional computational overhead.

排序理由 This is a research paper introducing a new methodology and algorithms for Monte Carlo Tree Search.

在 arXiv cs.LG 阅读 →

• AlphaZero
• Inverse-RPO
• mctx
• Monte Carlo Tree Search
• reinforcement learning

• 论文
• 其他

AI 生成摘要 · Google Gemini · 来自 1 个来源。 我们如何撰写摘要 →