arXiv Machine Learning

Certified World Models: Predictability Across Configuration, Horizon, and Resolution

arXiv:2606. 13092v3 Announce Type: replace Abstract: Scale buys interpolation; structure buys certifiable transfer.

arXiv AI
Jun 3

Exact equivariance, kept through training, buys zero-shot generalisation across the symmetry group

arXiv:2606. 03003v1 Announce Type: cross Abstract: A latent world model built from an equivariant encoder $E$ and an equivariant predictor $f$ inherits a provable symmetry of its training loss: when the world's dynamics genuinely carries a group $G$ acting on latents by an orthogonal representation $\rho(g)$, the one-step prediction relMSE is exactly invariant across the whole group, so fitting the dynamics on a restricted slice of orientations mathematically determines it on the entire orbit (j\v{u} y\=i f\v{a}n s\=an).

By Hongbo Wang (Stony Brook University)
arXiv Machine Learning
1d ago

Stable and Counterfactually Robust Physical World Models from Imposed Structure and Learned Physics

The paper introduces a world model that learns to predict the evolution of physical systems while respecting key physical principles. By hard‑coding a general structure—generating dynamics from the gradient of a learned energy via a fixed reversible operator and imposing constraints on energy, dissipation, and interventions—the model achieves second‑law compatible dissipation, accurate responses to parameter changes, long‑term stability, and robustness to disturbances. Experiments on an electromagnetic cavity, a particle‑in‑cell grid, and shallow‑water fluid demonstrate that the model can recover accurate constitutive functions, distinguish conserving from dissipating regimes, and transfer learned physics to unseen conditions, outperforming unconstrained models.

By Yufeng Wang, Parivesh Priye, Lu Wei, Haibin Ling
arXiv Machine Learning
Jul 14

A Control Theory of Predictability in Latent World Models

arXiv:2607. 10362v1 Announce Type: new Abstract: Latent world models are trained to predict future states in a learned representation and are then deployed inside a planner that selects actions by simulating them forward.

By Hanzhe You, Yonggang Zhang, Maohao Ran, Zhiqin Yang, Zhenyuan Zhang, Wei Xue, Jun Song, Xinmei Tian, Yike Guo
arXiv Machine Learning
Aug 31

An Enclosed Mode Is a Gauge Choice: Topology Relative to Reach in Certified Code World Models

The paper studies how a code‑world model can be perfectly accurate on the portion of the state space that a sampling gate can observe while potentially being arbitrarily wrong elsewhere. By treating the unobservable interior as an annular freeze mode, the authors formalize the notion of reach and show that acceptance with certainty fixes the model only on the reachable query set, leaving the rest as a gauge. Experiments on a minimal ring instrument demonstrate that a single channel width parameter can move the model through regimes of being unfalsifiable and harmless, falsifiable and costly, or instantly falsified, illustrating how topology relative to reach governs danger, repair, and mitigation strategies.

By Javier Aguilar Mart\'in
arXiv Machine Learning
Sep 18

Conservation Buys Stability and Factoring Buys Counterfactuals in Physical World Models

The paper demonstrates that learned simulators can fail in two distinct ways when conditions change: long‑horizon drift due to accumulated errors and incorrect responses to interventions on physical parameters. By adding a symplectic integrator to preserve conservative dynamics, rollouts remain stable for up to 100× the training horizon, while encoding physical coupling via explicit linear factorization allows the model to generalize to unseen signs of that coupling. The study shows that stability and counterfactual generalization arise from separate structural choices, enabling designers to impose each property independently.

By Yufeng Wang, Parivesh Priye, Lu Wei, Haibin Ling