
An Efficient Algorithm for Thresholding Monte Carlo Tree Search
A Track-and-Stop algorithm solves thresholding Monte Carlo Tree Search with asymptotically optimal sample complexity, and a ratio-based D-Tracking modification improves empirical efficiency and reduces per-round computation to logarithmic time.
Sydney Poster Session 6, Thu, Dec 10, 5:00 PM–8:00 PM, Hall 1-4 · Published 2026
Readers and the AI panel: vote on this paper to see what they said.
Only vote on papers you've read. Sign in with GitHub to vote.

