← Search

Julian Schrittwieser

6 accepted papers

2022

Approximate Exploitability: Learning a Best Response

IJCAI 2022poster

Researchers have shown that neural networks are vulnerable to adversarial examples and subtle environment changes. The resulting errors can look like blunders to humans, eroding trust in these agents. In prior games research, agent evaluation often focused on the in-practice game outcomes. Such eva…

Cited by 0SourcePDFScholar
2022

Planning in Stochastic Environments with a Learned Model

ICLR 2022spotlight

Model-based reinforcement learning has proven highly successful. However, learning a model in isolation from its use during planning is problematic in complex environments. To date, the most effective techniques have instead combined value-equivalent model learning with powerful tree-search methods.…

Cited by 85SourcePDFScholar
2022

Policy improvement by planning with Gumbel

ICLR 2022spotlight

AlphaZero is a powerful reinforcement learning algorithm based on approximate policy iteration and tree search. However, AlphaZero can fail to improve its policy network, if not visiting all actions at the root of a search tree. To address this issue, we propose a policy improvement algorithm based…

2022

Procedural generalization by planning with self-supervised world models

ICLR 2022poster

One of the key promises of model-based reinforcement learning is the ability to generalize using an internal model of the world to make predictions in novel environments and tasks. However, the generalization ability of model-based agents is not well understood because existing work has focused on m…

Cited by 39SourcePDFScholar
2021

Learning and Planning in Complex Action Spaces

ICML 2021spotlight

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 subsets of actions can be sampled for the purpose of policy evaluation and improvement. In this paper, we propose a gen…

Cited by 108SourcePDFScholar
2021

Online and Offline Reinforcement Learning by Planning with a Learned Model

NeurIPS 2021spotlight

Learning efficiently from small amounts of data has long been the focus of model-based reinforcement learning, both for the online case when interacting with the environment, and the offline case when learning from a fixed dataset. However, to date no single unified algorithm could demonstrate state…

Cited by 138SourcePDFScholar