Two new Monte Carlo tree search algorithms, CVaR-MCTS and W-MCTS, give provable PAC-level tail-risk controls and regret bounds for worst-case outcome scenarios.
Progressive strategies for monte-carlo tree search
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.LG 1years
2025 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Tail-Risk-Safe Monte Carlo Tree Search under PAC-Level Guarantees
Two new Monte Carlo tree search algorithms, CVaR-MCTS and W-MCTS, give provable PAC-level tail-risk controls and regret bounds for worst-case outcome scenarios.