Tag
The paper proposes 2FFS, a two-fidelity tree-search algorithm that adaptively balances cheap biased evaluations with expensive accurate evaluations in stochastic minimax trees for fixed-confidence best-action identification, with theoretical guarantees and experimental efficiency gains.