activity
20182025
most citedMastering Atari, Go, Chess and Shogi by Planning with a Learned Model

1.2k citations · 1.3k across the 10 of their papers we have counts for

collaborators

12 papers

cs.LG2025

General Uncertainty Estimation with Delta Variances

Simon Schmitt, John Shawe-Taylor, Hado van Hasselt

Decision makers may suffer from uncertainty induced by limited data. This may be mitigated by accounting for epistemic uncertainty, which is however challenging to estimate efficie…

cs.LG2023

Exploration via Epistemic Value Estimation

Simon Schmitt, John Shawe-Taylor, Hado van Hasselt

How to efficiently explore in reinforcement learning is an open problem. Many exploration algorithms employ the epistemic uncertainty of their own value predictions -- for instance…

cs.LG2022

Chaining Value Functions for Off-Policy Learning

Simon Schmitt, John Shawe-Taylor, Hado van Hasselt

To accumulate knowledge and improve its policy of behaviour, a reinforcement learning agent can learn `off-policy' about policies that differ from the policy used to generate its e…

cs.LG2021★ 10 cited

Learning and Planning in Complex Action Spaces

Thomas Hubert, Julian Schrittwieser, Ioannis Antonoglou +3

Many important real-world problems have action spaces that are high-dimensional, continuous or both, making full enumeration of all possible actions infeasible. Instead, only small…

cs.LG2021★ 12 cited

Muesli: Combining Improvements in Policy Optimization

Matteo Hessel, Ivo Danihelka, Fabio Viola +6

We propose a novel policy update that combines regularized policy optimization with model learning as an auxiliary loss. The update (henceforth Muesli) matches MuZero's state-of-th…

cs.LG2020

AlgebraNets

Jordan Hoffmann, Simon Schmitt, Simon Osindero +2

Neural networks have historically been built layerwise from the set of functions in , i.e. with activations and weights/parameters represented…

math.NA2020

Finding polynomial roots by dynamical systems -- a case study

Sergey Shemyakov, Roman Chernov, Dzmitry Rumiantsau +3

We investigate two well known dynamical systems that are designed to find roots of univariate polynomials by iteration: the methods known by Newton and by Ehrlich-Aberth. Both are…

cs.LG2019★ 1.2k cited

Mastering Atari, Go, Chess and Shogi by Planning with a Learned Model

Julian Schrittwieser, Ioannis Antonoglou, Thomas Hubert +9

Constructing agents with planning capabilities has long been one of the main challenges in the pursuit of artificial intelligence. Tree-based planning methods have enjoyed huge suc…

cs.LG2019

Gated Linear Networks

Joel Veness, Tor Lattimore, David Budden +8

This paper presents a new family of backpropagation-free neural architectures, Gated Linear Networks (GLNs). What distinguishes GLNs from contemporary neural networks is the distri…

cs.LG2019★ 4 cited

Off-Policy Actor-Critic with Shared Experience Replay

Simon Schmitt, Matteo Hessel, Karen Simonyan

We investigate the combination of actor-critic reinforcement learning algorithms with uniform large-scale experience replay and propose solutions for two challenges: (a) efficient…

cs.LG2018★ 24 cited

Multi-task Deep Reinforcement Learning with PopArt

Matteo Hessel, Hubert Soyer, Lasse Espeholt +3

The reinforcement learning community has made great strides in designing algorithms capable of exceeding human performance on specific tasks. These algorithms are mostly trained on…

cs.LG2018★ 40 cited

Kickstarting Deep Reinforcement Learning

Simon Schmitt, Jonathan J. Hudson, Augustin Zidek +8

We present a method for using previously-trained 'teacher' agents to kickstart the training of a new 'student' agent. To this end, we leverage ideas from policy distillation and po…