





















Abstract:Monte Carlo Tree Search (MCTS) is a widely used approach for policy improvement through search with increasing popularity for real world applications. Due to the sequential and deterministic nature of its search, runtime-scaling of MCTS with parallel compute remains a major challenge. We introduce Particle MCTS (PMCTS), to our knowledge the first principled parallel MCTS algorithm which is suited for neural network evaluations and can preserve formal policy improvement guarantees. Empirically, PMCTS scales well with parallel compute and significantly outperforms the popular heuristic-based baselines across domains.
| Subjects: | Machine Learning (cs.LG) |
| Cite as: | arXiv:2605.08982 [cs.LG] |
| (or arXiv:2605.08982v1 [cs.LG] for this version) | |
| https://doi.org/10.48550/arXiv.2605.08982 arXiv-issued DOI via DataCite (pending registration) |
From: Yaniv Oren [view email]
[v1]
Sat, 9 May 2026 14:54:07 UTC (156 KB)
此内容由惯性聚合(RSS阅读器)自动聚合整理,仅供阅读参考。 原文来自 — 版权归原作者所有。