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.
AD-WM is a new action‑discriminative joint‑embedding world model designed for counterfactual model predictive control. It augments residual latent dynamics with action‑recovery regularization based on inverse dynamics and conditional mutual information, while discarding auxiliary heads at test time so that MPC remains unchanged. Experiments on OGBench‑Cube and other simulation environments show substantial gains in hard‑start success and mean success, and zero‑shot transfer to a Franka robot improves pick‑and‑place success from 42.2% to 71.1%.
arXiv:2608. 16287v1 Announce Type: new Abstract: Joint-embedding predictive world models plan by scoring predicted terminal embeddings against a goal embedding using a cost defined on the representation itself.
arXiv:2607. 04464v1 Announce Type: cross Abstract: World-model evaluation for model-based reinforcement learning typically asks whether the learned model predicts reward and value well, which can leave planning-relevant errors in the model's latent rollouts unmeasured.
The paper investigates why latent world models, despite accurate latent predictions, can perform poorly in downstream planning. It introduces the concept of action-identifiability and formalizes it via Bayes inverse risk, showing that self-decodable predicted transitions may encode domain‑specific action relationships that do not transfer to real environments. Using the Action‑Consistency Transfer Matrix (ATM), the authors demonstrate that true‑transition action‑identifiability correlates strongly with planning success across several benchmarks, and that the ATM can diagnose cross‑domain inconsistencies and aid lightweight model screening.
arXiv:2511. 02748v2 Announce Type: replace-cross Abstract: We argue that sixth-generation (6G) intelligence is not fluent token prediction but the capacity to imagine and choose -- to simulate future scenarios, weigh trade-offs, and act with calibrated uncertainty.
arXiv:2608. 12959v1 Announce Type: cross Abstract: Latent world models are judged by how well they predict, so when planning fails at long horizons the natural reading is that the predictor degrades.
The paper introduces the Dual-Latent World Model (Dual-WM), which separates local execution and long-range planning into distinct latent spaces and dynamics models. A new learning method, Long-Horizon Representation Learning with Weighted Rollout (LoRe), supervises predictions at both levels using exponential horizon weights. Experiments on five goal-conditioned visual control tasks show that Dual-WM improves success rates over strong baselines, especially at longer horizons.
arXiv:2606. 27806v1 Announce Type: new Abstract: World models for language agents come in two useful forms.
The paper introduces Dual-Frontier, a learning principle that determines when an agent should trust its world model for decision-making. It formalizes the failure-attribution problem as a counterfactual decomposition of return loss and shows that its components cannot be identified from passive interaction, even for finite-horizon planners. Dual-Frontier allows a model‑guided decision only when the predicted advantage exceeds a certified bound on decision‑relevant world‑model error; otherwise, the agent focuses on verifying the model. The authors provide theoretical guarantees, adaptive evidence reuse, and experimental validation on controlled and realistic benchmarks, demonstrating improved decision quality and reliability.
arXiv:2606. 03685v1 Announce Type: cross Abstract: Supervised fine-tuning (SFT) improves end-to-end classical planning in large language models (LLMs), but do these models also learn to represent and reason about the planning problems they are solving?
LLM‑BabyBench transforms the BabyAI gridworld into a fully observable, purely textual setting that isolates planning as the sole source of failure. By serialising the entire grid, providing formal instructions, and validating actions deterministically, the benchmark introduces the PPD suite—Predict, Plan, and Decompose tasks—each scored with metrics that separate mission understanding from sequencing. Across a range of large language models, simulation accuracy is high while planning success drops sharply beyond a model‑specific horizon, revealing that plan length—not grid size—drives failure and that models often commit to a single corridor‑shaped route without backtracking.