arXiv Machine Learning By Xianyi Wu

Is Monte Carlo Tree Search Just Every-Visit Monte Carlo Control?

Read the original on arXiv Machine Learning →

The article argues that Monte Carlo Tree Search (MCTS) and every‑visit Monte Carlo (MC) control are essentially the same method, differing only in terminology and presentation. It shows that MCTS’s four stages—selection, expansion, simulation, and backup—can be reduced to two core operations: sampling trajectories under the current policy and performing every‑visit MC updates. The note aims to make this equivalence explicit and easier to recognize.

Machine-generated by The Flow from the publisher's headline and feed description — not written or checked by a human. The full article lives at arXiv Machine Learning.

arXiv AI
Jul 20

Process Reward Informed Tree Rollout for Effective Multi-Turn RL

arXiv:2607. 15610v1 Announce Type: cross Abstract: Reinforcement learning (RL) has become a key approach for training LLM agents, yet popular methods such as GRPO/RLOO rely on multiple independently sampled complete trajectories for advantage estimation.

By Xintong Li, Sha Li, Yuwei Zhang, Changlong Yu, Rongmei Lin, Hongye Jin, Shuyi Guan, Xin Liu, Linwei Li, Qingyu Yin, Jingbo Shang
arXiv Machine Learning
Sep 10

PMCTS: Principled Parallelized Inference Time Scaling with Particle Monte Carlo Tree Search

The paper introduces Particle MCTS (PMCTS), a parallelized version of Monte Carlo Tree Search designed for GPU acceleration and batch-parallel neural network evaluations. PMCTS preserves policy improvement guarantees of modern MCTS algorithms while scaling efficiently with parallel compute. Empirical results show that PMCTS consistently outperforms or matches heuristic-based baselines across various MCTS and reinforcement learning domains, including chess, Go, and both discrete and continuous control benchmarks.

By Yaniv Oren, Viliam Vadocz, Joery A. de Vries, Wendelin B\"ohmer, Matthijs T. J. Spaan, Hendrik Baier