Super-Exponential Regret for UCT, AlphaGo and Variants

Abstract

We improve the proofs of the lower bounds of Coquelin and Munos (2007) that demonstrate that UCT can have (…(1)…) regret (with (D) exp terms) on the D-chain environment, and that a `polynomial' UCT variant has 2(2(D - O( D))) regret on the same environment -- the original proofs contain an oversight for rewards bounded in [0, 1], 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 2(2(D - O( D))) regret.

0

Turn this paper into a full lesson

ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…