117 citations · 278 across the 28 of their papers we have counts for
Showing 2024Show all
3 papers · 1 filter
cs.AI2024
Exponential Speedups by Rerooting Levin Tree Search
Laurent Orseau, Marcus Hutter, Levi H. S. Lelis
Levin Tree Search (LTS) (Orseau et al., 2018) is a search algorithm for deterministic environments that uses a user-specified policy to guide the search. It comes with a formal gua…
cs.LG2024
Super-Exponential Regret for UCT, AlphaGo and Variants
Laurent Orseau, Remi Munos
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…
cs.LG2024★ 1 cited
Learning Universal Predictors
Jordi Grau-Moya, Tim Genewein, Marcus Hutter +8
Meta-learning has emerged as a powerful approach to train neural networks to learn new tasks quickly from limited data. Broad exposure to different tasks leads to versatile represe…