Structured Simulators and Neural Operators › Why Structure Belongs in a World Model

Throughout Part I we argued that a world model is a learned surrogate for the environment's transition dynamics. Part III showed that the representation of state matters enormously: object-centric and relational state (Part III, Chapter 5) made latents more controllable and composable. This chapter makes the complementary point about the dynamics: the function that advances state through time can itself carry structure, and that structure is a form of prior knowledge you can spend instead of data. The two ideas compose rather than compete. A well-structured state makes the transition easier to learn; a well-structured transition makes the state representation's structure pay off, because compositional state is only useful if the dynamics respect that composition. An object-centric latent whose dynamics are a dense matrix over the flattened vector quietly destroys the decomposition the representation worked so hard to find.

The physical world has strong regularities that a generic function approximator must rediscover from scratch, and each of these regularities, once stated, suggests a family of architectures:

• Locality: many hyperbolic systems and explicitly local interactions propagate influence through neighboring regions at finite speed. Sound takes time to travel, and a disturbance at one end of a beam is not felt at the other until material waves carry it there. This motivates graph architectures with local message passing. The scope matters: diffusion has nonzero mathematical influence at arbitrary distance for positive time, and elliptic solution maps can depend globally on boundary data even when their differential operators are local.
• Relationality: many forces arise from interactions between pairs of entities, with the same law applied to each pair. Gravity applies the same pairwise law everywhere; its force depends on the bodies' masses and relative displacement, not arbitrary identities. This is what licenses sharing one learned interaction function across all entity pairs.
• Continuity and smoothness: states evolve along trajectories, not in arbitrary jumps, at least away from impacts and contacts. This is what licenses differential-equation models and integration as the mechanism of prediction.
• Conservation: in a closed, unforced system, conserved quantities such as mass, momentum, and energy restrict the space of plausible futures. Boundaries, forcing, dissipation, and exchanges with the environment introduce balance terms, so an apparent gain or loss must be interpreted with the system boundary made explicit.

When you hard-code these regularities, the model is reliable only where the encoded physics is valid. Learning without them offers more flexibility but may require more data and may generalize poorly. The methods in this chapter let you learn within a structured hypothesis space, so the data can focus on what you do not know. This is the same economy that shaped the identifiability discussion in Part II: valid structural assumptions shrink the hypothesis space and can reduce the observations needed for identification and improve generalization.

One caution before we begin, because it echoes a theme from Part I: a structured model that predicts well in open loop is not automatically a good model for control. Structure improves the trajectories a model produces, but planning exercises the model differently than prediction does: it pushes the model along action sequences it was never evaluated on, multiplies small errors over long horizons, and depends on gradients that can be wrong even when predictions look right. We will return to this distinction repeatedly, and it becomes central when these models drive planning in Part VII.