Model-based RL & planning
Learned world models, background versus decision-time planning, and the AlphaGo to MuZero lineage. World Models and MCTS are for everyone; the rest is a specialisation.
What you will learn
Model-free agents pay for every step of experience. Dyna-Q in Phase 1 showed that a learned model can multiply that experience, and also how the model's errors compound over a rollout.
Learned dynamics with uncertainty (PILCO, PETS), latent world models and policies trained inside them (World Models, PlaNet, Dreamer, DreamerV3), short model rollouts that bound compounding error (MBPO), and decision-time planning: MCTS, AlphaGo to AlphaZero, and MuZero's search over a learned model. Two exercises: learn a latent model and measure how far ahead it stays trustworthy, and implement UCT for a game.
You can train a policy in imagination against a model-free baseline at the same budget, implement tree search, and explain what MuZero learns that AlphaZero is given.
Deisenroth & Rasmussen, ICML 2011
PILCO
Gaussian-process dynamics with uncertainty for extreme data efficiency.
The uncertainty-aware model idea leads to PETS.
Resources
- PILCO (PDF) (paper)
Chua et al., NeurIPS 2018
Deep RL in a Handful of Trials
Probabilistic ensemble dynamics plus CEM planning.
Ensembles lead to MBPO.
Resources
- PETS (paper)
- CS285 lecture 11: Model-Based RL (5 parts) (video, optional)
Ha & Schmidhuber, NeurIPS 2018
World Models
Learn a VAE+RNN latent world model and train a controller inside it. Highly readable.
Direct ancestor of PlaNet and Dreamer.
Learning outcome: Explain what a latent world model has to predict, and why training a controller inside it can work at all.
Prerequisites
Resources
- World Models (paper)
- Interactive article (site, optional)
- CS285 lecture 18: Variational Inference and Generative Models (4 parts) (video, optional)
Janner et al., NeurIPS 2019
When to Trust Your Model
Short model-generated rollouts branched off real states, feeding SAC. Bounds compounding model error.
The standard modern Dyna-style method.
Resources
- MBPO (paper)
- CS285 lecture 12: Model-Based RL with Policies (4 parts) (video, optional)
Hafner et al., ICML 2019; ICLR 2020; ICLR 2021
PlaNet / Dreamer / DreamerV2
Learn latent dynamics and train an actor-critic purely in imagination.
Leads to DreamerV3.
Deliverable: a model, a horizon plot, a comparison
Train a small latent world model
Learn latent dynamics on one control task, measure how far ahead the model stays trustworthy, and train a policy inside it against a model-free baseline at the same interaction budget.
The ideas you need before reading DreamerV3's engineering.
Learning outcome: Say where a learned model stops being useful, from your own measurements rather than a paper's.
Prerequisites
Resources
- DM Control (code)
Exercise deliverables
- A latent dynamics model trained on a DM Control task
- Prediction quality plotted against imagination horizon
- A policy trained in imagination compared against a model-free baseline at equal environment interaction
- A paragraph on where the imagined rollouts stop being trustworthy
Hafner et al., arXiv 2023; Nature 2025
Mastering Diverse Domains through World Models
One configuration across 150+ tasks. First to collect diamonds in Minecraft from scratch without human data. Must-read frontier model-based agent.
The reference for the one algorithm, many domains ambition.
Resources
- DreamerV3 (arXiv) (paper)
- Nature 2025 version (paper)
Browne et al., IEEE TCIAIG 2012
Monte Carlo Tree Search
Selection, expansion, simulation, backup, and UCT's exploration term. Decision-time planning: search from the current state instead of learning a policy for all states.
The search half of AlphaZero and MuZero. Read this before either of them.
Learning outcome: Implement UCT for a small deterministic game and explain what the tree statistics converge to.
Resources
- A Survey of Monte Carlo Tree Search Methods (paper)
- CS285 lecture 10: Optimal Control and Planning (5 parts) (video, optional)
Silver et al., Nature 2016; Nature 2017; Science 2018
AlphaGo / AlphaGo Zero / AlphaZero
MCTS plus deep policy and value nets. Then self-play from scratch. Then one algorithm for Go, chess and shogi. Read AlphaZero closely.
Directly into MuZero.
Prerequisites
Resources
- AlphaGo (Nature 2016) (paper)
- AlphaGo Zero (Nature 2017) (paper)
- AlphaZero (arXiv) (paper)
- AlphaZero (Science 2018) (paper, optional)
- Silver lecture 10: Classic Games (video, optional)
Schrittwieser et al., Nature 588, 2020
MuZero: Mastering Atari, Go, Chess and Shogi by Planning with a Learned Model
MCTS over a learned latent model predicting reward, value and policy. No given rules. Non-negotiable landmark.
EfficientZero. Conceptual cousin of RL search for LLM reasoning.
Resources
- MuZero (arXiv) (paper)
- MuZero (Nature 2020) (paper)
Ye et al., NeurIPS 2021
EfficientZero
MuZero plus self-supervised consistency. Human-level Atari 100K.
Sample-efficient planning.
Resources
- EfficientZero (paper)
Deliverable: a player, a strength curve
UCT for a small game, then a minimal AlphaZero
Implement UCT for Connect Four and measure playing strength against simulation count. Then, if you want the full picture, replace the rollouts with a small trained network.
Makes AlphaZero and MuZero concrete instead of impressive.
Learning outcome: Explain exactly what the learned network replaces in plain MCTS, having built both.
Prerequisites
Exercise deliverables
- UCT for Connect Four beating random and greedy opponents
- Playing strength plotted against simulations per move
- Optional: a minimal AlphaZero on tic-tac-toe or Connect Four
- A paragraph on what the policy and value networks replace in plain MCTS
Hansen et al., ICML 2022; ICLR 2024
TD-MPC / TD-MPC2: Scalable, Robust World Models for Continuous Control
Short-horizon planning in a task-oriented latent space plus a terminal value function. One recipe across many continuous-control tasks.
Current SOTA-competitive continuous-control planner.