1.1k citations · 1.1k across the 10 of their papers we have counts for
Showing 2018Show all
2 papers · 1 filter
cs.LG2018
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…
cs.AI2018
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…