265 citations · 1.6k across the 43 of their papers we have counts for
5 papers · 1 filter
Single-Agent Policy Tree Search With Guarantees
Laurent Orseau, Levi H. S. Lelis, Tor Lattimore +1
We introduce two novel tree search algorithms that use a policy to guide search. The first algorithm is a best-first enumeration that uses a cost function that allows us to prove a…
Woulda, Coulda, Shoulda: Counterfactually-Guided Policy Search
Lars Buesing, Theophane Weber, Yori Zwols +4
Learning policies on data synthesized by models can in principle quench the thirst of reinforcement learning algorithms for large amounts of real experience, which is often costly…
Relational recurrent neural networks
Adam Santoro, Ryan Faulkner, David Raposo +7
Memory-based neural networks model temporal data by leveraging an ability to remember information for long periods. It is unclear, however, whether they also have an ability to per…
Learning and Querying Fast Generative Models for Reinforcement Learning
Lars Buesing, Theophane Weber, Sebastien Racaniere +8
A key challenge in model-based reinforcement learning (RL) is to synthesize computationally efficient and accurate environment models. We show that carefully designed generative mo…
Learning to Search with MCTSnets
Arthur Guez, Théophane Weber, Ioannis Antonoglou +5
Planning problems are among the most important and well-studied problems in artificial intelligence. They are most typically solved by tree search algorithms that simulate ahead in…