Across the state-of-the-art latent world models studied, none actually models the environment's dynamics faithfully, measured by a new latent rollout consistency metric
AspireAI community · arXiv
A paper submitted October 27, 2026 argues that latent world models are routinely credited with reasoning about long temporal and spatial horizons on the strength of task performance alone, which says little about whether the learned latent dynamics actually reflect the structure of the environment. The authors formalize the gap as faithful latent world models, an equivariance condition between the environment's transition map and the model's learned latent dynamics, and introduce latent rollout consistency as a metric for evaluating action-conditioned latent prediction. Applying it to the state-of-the-art latent world models they studied, the result is blunt: none of them solves the task by faithfully modeling the environment's dynamics. The value here is diagnostic rather than constructive, since the paper proposes a measurement instrument and a negative finding rather than a better world model, so what it changes is how practitioners should read benchmark scores that claim world-model reasoning. The scope is also limited to the models the authors selected, so it does not establish that faithful latent world models are impossible, only that current ones do not meet the condition.
Read the story and explore more from the AspireAI community.
Two sparse-autoencoder analyses have resisted scaling: matching semantically similar features across layers, and compressing large feature circuits into interpretable supernodes. This paper argues both are the same underlying problem, estimating semantic distances between SAE features that sit on different activation manifolds. Its representation treats each feature not as a single decoder vector but as an activation-weighted distribution over the hidden states expressing it, projects those distributions into a shared reference space, and compares them with Wasserstein distance. The representation is proved invariant to activation rescaling and stable under perturbation, and recovers true matches under finite-sample margin conditions. Empirically it outperformed decoder-vector and LLM-based baselines and captured subtle functional distinctions between related features, and it compressed large feature circuits into interpretable supernodes automatically. The limitation is that this is interpretability tooling: the paper demonstrates better feature matching and circuit compression, not that downstream interpretability claims become more accurate.