加载中…
We improve the proofs of the lower bounds of Coquelin and Munos (2007) that demonstrate that UCT can have regret (with exp terms) on the -chain environment, and that a `polynomial’ UCT variant has regret on the same environment – the original proofs contain an oversight for rewards bounded in , which we fix in the present draft. We also adapt the proofs to AlphaGo’s MCTS and its descendants (e.g., AlphaZero, Leela Zero) to also show regret.

生成讲解博客的中文版本

生成AI智能校验的中文版本