arXiv AI By Yibin Dong

Why Does the Future Branch? Identifiable Closure Tests for Stochastic Physical World Models

Read the original on arXiv AI →

arXiv:2608. 00591v2 Announce Type: replace Abstract: A calibrated stochastic world model can reveal how uncertain a future is without revealing why it branches.

Machine-generated by The Flow from the publisher's headline and feed description — not written or checked by a human. The full article lives at arXiv AI.

Hugging Face Trending Papers
Sep 8

Hi-FLoop: Hierarchical State-Feedback Loops for Multi-Timescale World Modeling

Hi-FLoop introduces a hierarchical state‑feedback framework for multi‑agent traffic simulation that reconciles decision time scales over an 8‑second rollout. The model uses eight scene‑level Worlds to maintain joint hypotheses, with an 8‑second Goal, 2‑second Preview, and 1‑second Control hierarchy, and commits only executed prefixes every 0.5 seconds to preserve factual consistency. A joint preview interaction graph and a prefix‑frozen A‑to‑B cascade enable sparse interaction refinement and accurate state recovery, achieving an overall score of 0.689987 on the H‑D public‑validation split and strong oracle‑minADE performance. whyItMatters":"The paper presents a novel multi‑timescale approach that improves consistency and realism in long‑horizon traffic simulations, as evidenced by its competitive evaluation metrics."

arXiv Machine Learning
Jul 30

What Can Latent World Models Know? Physical Parameter Identifiability in Multimodal Predictive Representations

arXiv:2607. 27017v1 Announce Type: new Abstract: A central premise of latent world models is that predicting the future forces a representation to internalize the physics of its environment.

By Kaizhen Tan (New York University, Carnegie Mellon University), Xin Xu (Carnegie Mellon University), Siru Tao (Carnegie Mellon University), Hanzhe Hong (Carnegie Mellon University), Yang Feng (Columbia University), Heqing Du (Columbia University)
Hugging Face Trending Papers
Aug 18

An Omitted Mode Is a Rare Rule: The Sampling-Verification Danger Law in Continuous Code World Models

The paper investigates the safety of Code World Models, where a language model generates an executable world model that a planner uses, and the model is accepted if it reproduces sampled transitions. It defines the pipeline’s danger as the expected risk, showing that the probability of missing a critical event across N independent rollouts is (1‑r)^N, and that an additional acceptance sample adds to the exponent. Experiments on hybrid instruments reveal that mode‑blind models can be exploited, and the authors provide theoretical bounds on localization budgets and demonstrate that acceptance only guarantees sample consistency, covering about two percent of the planner’s queries.

arXiv AI
Sep 15

When Should a World Model Move? Loss-Conditioned State Execution

The paper introduces loss‑conditioned state execution, a model‑agnostic technique that decides whether to apply a world model’s proposed state change or keep the current state based on whether the change reduces downstream loss. It formalizes state movability as the existence of a loss‑reducing feasible correction and constructs loss‑specific proposals from predictive distributions, executing them only when a groupwise lower confidence bound on loss improvement is positive. Experiments on forecasting and dynamics benchmarks show that the method accepts updates for a subset of cases, achieving lower bounded loss than persistence or always executing the proposal, and highlights that event predictability and loss‑based decisions must be evaluated separately.

By Jintao Xu, Zhengyu Chen, Ben Zhang, Yongzhi Qi, Jianshen Zhang