An ε-agnostic algorithm for fixed-budget ε-good max-min action identification in depth-2 trees achieves misidentification probability decaying as exp(-~Θ(T/H₂(ε))).
It follows that phase k is sound, completing the induction for k≤KL−m
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.LG 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
$\varepsilon$-Good Action Identification in Fixed-Budget Monte Carlo Tree Search
An ε-agnostic algorithm for fixed-budget ε-good max-min action identification in depth-2 trees achieves misidentification probability decaying as exp(-~Θ(T/H₂(ε))).