Latent-Dynamics World Models
Dreamer, TD-MPC2, and DayDreamer: compact learned dynamics for imagination-based control.
- Last reviewed
- Reading time
- 9 min
- Citations
- 8
Of the six paradigms the taxonomy module separates, latent dynamics is the oldest and the only one with a decade of evidence that it improves sample efficiency on control. The idea is one sentence: learn a compact recurrent latent state, predict how that state and the reward evolve under the agent's actions, and do the learning or the planning entirely inside that imagination, without touching the real environment. Everything else, the decoder versus no-decoder split, the actor versus planner split, is a design choice on top of that sentence.
The interactive is a deterministic toy of compounding error, not a measured rollout from any of the papers. Drag the horizon slider to explore its assumed recurrence; the 3 to 15-step shaded band is illustrative, not a published reliable-horizon range. Table W.1 of the 2023 DreamerV3 preprint lists imagination horizon H = 15, while the same document's actor-critic section uses prediction horizon T = 16. The 2024 revision and 2025 Nature article also use T = 16. The two horizon labels have different values even within the 2023 preprint Hafner 2023.
Illustrative toy, not measured model performance. The 3-15-step band, error inputs, curves, and frames are teaching choices, not published reliability bounds. Source horizon settings are discussed in the article.
latent deviation Δ(15) = 0.301 units at one-step error 2.0%
In this deterministic toy latent rollout view the solid imagined path leaves the dashed true trajectory after the first few steps and has accumulated 0.301 units of toy deviation at t = 15 of 50; that peel illustrates the assumed error recurrence, not measured model drift or a second plot of the same deviation series.
Current imagined rollout
- horizon
- 15 steps
- one-step error
- 2.0%
- endpoint deviation
- 0.301
- mode
- with decoder
In this deterministic toy, latent deviation grows from 0 at step 0 to 0.301 units at the current 15-step horizon under the 2.0% one-step-error input. The shaded band is illustrative, from 3 to 15 steps; it is not a published range, confidence interval, or reliability bound.
Sampled latent deviation by imagination step
| step | deviation | range | playhead |
|---|---|---|---|
| 0 | 0.000 | before illustrative band | off |
| 10 | 0.200 | inside illustrative band | off |
| 15 | 0.301 | inside illustrative band | playhead |
| 20 | 0.402 | past illustrative band | off |
| 30 | 0.603 | past illustrative band | off |
| 40 | 0.806 | past illustrative band | off |
| 50 | 1.01 | past illustrative band | off |
The RSSM: a state you can dream in
In DreamerV3, the Recurrent State-Space Model (RSSM) combines a recurrent state that carries memory with a stochastic categorical representation. An encoder infers the representation from the recurrent state and observation. From the combined state, the model reconstructs inputs during training and predicts reward and episode continuation Hafner 2023.
The payoff is where learning happens. The actor and the critic are trained purely on imagined latent rollouts: start from a real encoded state, unroll the learned dynamics for a short horizon, and backpropagate value gradients through the learned model to improve the policy Hafner 2019. This imagination phase reuses the learned world model without collecting new environment transitions Hafner 2019. The environment is only needed to collect the experience the model is fitted to.
DreamerV3: one recipe across 150 tasks
DreamerV3 was evaluated on more than 150 tasks across eight domains with fixed hyperparameters. Its robustness techniques include symlog transforms for vector observations, free bits with KL balancing, and percentile-based return normalization. The paper's reward-loss descriptions differ: the detailed distribution section describes two-hot targets for reward and value prediction, whereas an earlier world-model paragraph says the reward predictor uses symlog squared loss Hafner 2023.
The headline result is Minecraft. In their 2025 Nature article, Hafner, Pasukonis, Ba, and Lillicrap describe DreamerV3 as, to their knowledge, the first algorithm to collect diamonds in Minecraft from scratch without human data or adaptive curricula. The experiment used a MineRL-based environment with abstract crafting actions, accelerated block breaking, and sparse intermediate rewards. Its 12 rewarded milestones are log, plank, stick, crafting table, wooden pickaxe, cobblestone, stone pickaxe, iron ore, furnace, iron ingot, iron pickaxe, and diamond Hafner 2023.
TD-MPC and TD-MPC2: drop the decoder, plan at every step
The TD-MPC line takes the opposite position on the decoder. TD-MPC jointly trains reward prediction, TD value prediction, and latent-state consistency without reconstructing observations. At each control step it uses short-horizon MPPI trajectory optimization and a learned terminal value to estimate return beyond the rollout Hansen 2022. TD-MPC2 learns joint-embedding, reward, and value predictions without reconstructing observations. At each decision step, MPPI evaluates sampled action sequences through latent rollouts, combining predicted rewards with a learned terminal value. Some candidate sequences come from the learned policy prior; planning is warm-started from the previous decision step's solution shifted by one step. The first planned action is executed. Hansen 2023
The multitask experiment trained a single reported 317M-parameter configuration on 545M replay-buffer transitions from 240 single-task agents: 50 Meta-World tasks and 30 DMControl tasks, spanning different embodiments and action spaces. This offline 80-task experiment is separate from the 104-task online benchmark. Across five tested model sizes, the authors report increasing aggregate normalized scores, averaging Meta-World success rates and normalized DMControl episode returns; this is not a claim of perfect success on every task Hansen 2023. Unlike a reconstruction-based world model, TD-MPC2 does not produce predicted observation images. It selects actions by planning, with its policy network supplying a fraction of candidate trajectories Hansen 2023.
DayDreamer: imagination on physical hardware
DayDreamer builds on the DreamerV2 implementation and learns online on four physical robots without a simulator: Unitree A1, UR5, XArm, and Sphero Ollie. The experiments use the same learning hyperparameters, not identical sensor inputs, action spaces, or control rates Wu 2022. In one A1 training run, the robot learned to roll off its back, stand, and walk forward with a pronking gait after about one hour of real-world training. The setup used 20 Hz joint-angle commands realized by a PD controller, filtered motor commands, and manual repositioning at the training-area boundary without changing the robot's joint configuration or orientation. SAC learned to roll over but did not stand or walk within that experiment's small data budget; the paper does not measure how many days SAC would need. The one-hour result is training time, not inference latency or the duration of one rollout Wu 2022.
The horizon problem
Table W.1 of the 2023 DreamerV3 preprint lists imagination horizon H = 15, while the same document's actor-critic section uses prediction horizon T = 16. The 2024 revision and 2025 Nature article also use T = 16. The two horizon labels have different values even within the 2023 preprint Hafner 2023. In TD-MPC2 v2, Table 8 lists planning horizon H = 3; the planner bootstraps beyond the rollout with a learned terminal value Hansen 2023. DayDreamer v1 likewise gives two labels: its actor-critic methods state a planning horizon H = 16, while Appendix D lists imagination horizon H = 15. Its methods and appendix thus report different horizon values Wu 2022. These source settings are step counts, not control frequencies or universal bounds on reliable prediction.
Both display modes in the figure are schematic. The Dreamer-labelled mode draws illustrative frames; the TD-MPC2-labelled mode omits reconstruction and shows a toy reward-error readout equal to 0.35 times the toy latent deviation. The curves, frames, and shaded band are not measured model predictions, published losses, or reliability estimates.
Successors and open limits
The lineage is still moving. Robotic World Model (RWM) uses a GRU-based model to predict observations over long horizons under partial observability. Its dual-autoregressive mechanism updates hidden states across the observation-action history and feeds predicted observations back into later predictions. The authors train velocity-tracking policies with MBPO-PPO in simulation and report zero-shot transfer to ANYmal D and Unitree G1, including tests under external disturbances. Safe online policy learning directly on hardware remains a limitation Li 2025. Dream-MPC samples candidate action sequences from a policy rolled out through a learned latent world model, then refines the actions by gradient ascent on predicted return with an uncertainty penalty. It mixes policy proposals with previously optimized actions and executes only the first action before replanning. Spieler and Behnke replace MPPI at test time in pretrained TD-MPC2 and BMPC models. Their main comparison covers 24 simulated continuous-control tasks: eight each from DeepMind Control Suite, HumanoidBench, and Meta-World, with three random seeds and ten test episodes. On the pooled normalized scores, the BMPC-based variant improves interquartile median by 26.7% and mean by 20.5% relative to BMPC; the TD-MPC2-based variant improves on its policy alone but does not consistently match MPPI. These are aggregate, model-specific results, not wins on every task or a hardware experiment. Six image-observation tasks and a four-environment study using the planner during training are separate experiments Spieler 2026. Fast-WAM retains video co-training but removes explicit future-video generation at inference: its video backbone encodes the current frame once, then an action expert still denoises an action chunk. Its controlled comparisons report similar success rates to its imagine-then-execute variants on LIBERO and RoboTwin 2.0. On the Galaxea R1 Lite towel-folding task, the paper reports inference latency of 190 ms for Fast-WAM versus 810 ms for Fast-WAM-IDM, measured on a single NVIDIA RTX 5090D V2 32GB GPU. These are inference latencies, not robot-control frequencies Yuan 2026.
The primary papers describe narrower limits than a verdict on the whole paradigm:
- Generalization remains open. TD-MPC2's authors describe transfer to new embodiments and integration with vision-language models as future opportunities, and say that this level of generalization will likely require several orders of magnitude more tasks. Extending their method to discrete action spaces is also an open problem Hansen 2023.
- Hardware learning has costs. DayDreamer's authors note that many hours of learning can cause wear requiring human intervention or repair. They also call for longer training to establish the limits of both Dreamer and its baselines Wu 2022.
The one-hour A1 run and TD-MPC2's offline 80-task experiment address different questions. Neither establishes a universal horizon, a control-rate ceiling, or a field-wide advantage over every other world-model paradigm.
Pick the model's role before its architecture
A latent model can serve three different roles. It can generate imagined experience for actor and critic training, as in Dreamer. It can score candidate action sequences online, as in TD-MPC2. Or it can supply a representation while a separate policy acts. Each role has a different failure budget. Training-only imagination may tolerate slow generation but can bias the learned policy silently; online planning needs predictable latency and a fallback; representation learning needs evidence that the latent preserves task-relevant distinctions.
Write the loop before selecting the loss: observation encoder, latent update, action proposal, rollout horizon, score, replanning rate and stop condition. Evaluate multi-step state usefulness and policy ranking, not reconstruction alone. Log planner improvement over its policy prior, because a planner that never changes the proposed action is paying model cost without using the model. The model-based robot-learning guide covers these loops, and the evaluation guide defines evidence for each role.
See also
- What Is a World Model?
An editorial comparison of six world-model example groups: what they predict, in what representation, and for what purpose. The survey-defined functional criterion is decision-relevant prediction, not visual plausibility alone.
- Model-Based Robot Learning
Learn dynamics, plan through them, and improve from imagined rollouts: the common structure behind Dreamer, TD-MPC2 and robotic world models.
- World Model Evaluation for Robotics
Visual fidelity is not enough: evaluate action sensitivity, rollout consistency, task progress, policy ranking and real-world agreement.
- JEPA and the Non-Generative Counterargument
V-JEPA 2 and LeCun's case that prediction in representation space beats pixel generation.
Linked from
- What Is a World Model?
An editorial comparison of six world-model example groups: what they predict, in what representation, and for what purpose. The survey-defined functional criterion is decision-relevant prediction, not visual plausibility alone.
- JEPA and the Non-Generative Counterargument
V-JEPA 2 and LeCun's case that prediction in representation space beats pixel generation.
- Model-Based Robot Learning
Learn dynamics, plan through them, and improve from imagined rollouts: the common structure behind Dreamer, TD-MPC2 and robotic world models.
- State Estimation
Kalman filters, factor graphs, and pose estimation from noisy sensors.
References
Danijar Hafner, Timothy Lillicrap, Jimmy Ba, Mohammad Norouzi, ICLR 2020, 2019.
https://arxiv.org/abs/1912.01603
Danijar Hafner, Jurgis Pasukonis, Jimmy Ba, Timothy Lillicrap, Nature 2025, 2023.
https://arxiv.org/abs/2301.04104
Nicklas Hansen, Xiaolong Wang, Hao Su, ICML 2022.
https://arxiv.org/abs/2203.04955
Nicklas Hansen, Hao Su, Xiaolong Wang, ICLR 2024, 2023.
https://arxiv.org/abs/2310.16828
Philipp Wu, Alejandro Escontrela, Danijar Hafner, Ken Goldberg, Pieter Abbeel, CoRL 2022.
https://arxiv.org/abs/2206.14176
Chenhao Li, Andreas Krause, Marco Hutter, 2025.
https://arxiv.org/abs/2501.10100
Jonathan Spieler, Sven Behnke, ICML 2026.
https://arxiv.org/abs/2605.04568
Tianyuan Yuan, Zibin Dong, Yicheng Liu, Hang Zhao, 2026.
https://arxiv.org/abs/2603.16666
Spot a factual error or missing qualification? Report a content correction.