Predictive and Generative Objectives › Predictive and Generative Objectives

Imagine building a robot that has to catch a bouncing ball. Before it can move its arm, it needs some internal sense of where the ball is going. That internal sense, whatever form it takes, is a world model. The whole point of a world model is to anticipate what happens next, and the way we teach a machine to anticipate is to give it an objective: a scalar number that measures how well its predictions match the world. Everything else in the field, the architectures, the latent codes, the planning loops, ultimately serves that single scalar.

This chapter is about the objective function. It is easy to treat the choice of loss as a detail left to whoever writes the training code, but that choice silently determines what the model learns to care about, which aspects of the world it will represent, and which it will ignore. Two models with identical architectures can end up behaving very differently because one was trained to predict pixels and the other was trained to predict a compact latent state. One may produce gorgeous rollouts of a static scene while being useless for control, and the other may look ugly but drive a car successfully. The objective is the model's job description.

It helps to separate several meanings of a good world model. Predictive fidelity asks whether outputs match future observations, which reconstruction and likelihood measure directly. Representation quality asks whether the latent state captures task-relevant variables, independent of whether they can be rendered into pixels. Uncertainty quality asks whether probabilistic predictions are calibrated. Decision usefulness asks whether a planner or controller built on the model achieves good outcomes. Their priority depends on the application: control centers decision usefulness, while simulation or generation may center fidelity and calibration. A loss usually optimizes only part of this set directly, so performance on one axis does not establish performance on another.

Part V surveyed the families of world-model architectures: recurrent state-space models, transformers, autoregressive token models, diffusion and flow models, and predictive-embedding models like JEPA. Part VI turns to the question that those architectures leave open: what do we actually ask them to compute, and how do we prevent the training signal from building representations that look great on a leaderboard yet collapse the moment the agent has to plan? This chapter builds the vocabulary and the practical intuition for predictive and generative objectives. Along the way it reveals a recurring tension that will follow us through the rest of the book: the loss that is easiest to optimize need not produce a control-relevant state.

We start with the oldest and most direct family of objectives, reconstruction and likelihood, and see why they are so appealing and so treacherous. We then examine contrastive and masked prediction, which trade pixel fidelity for representation quality. From there we move to multi-step and overshooting losses, the machinery that turns a one-step predictor into a rollout engine. Finally, we look at how to balance representation, dynamics, and reward losses when a single network is asked to do several jobs at once.