arXiv AI

When Can World Models Recover Physical Laws?

arXiv Machine Learning
Oct 3

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
Sep 22

Discovering Physical Representation Languages

arXiv:2609.23381v1 Announce Type: new Abstract: Before a machine can discover a physical law, it must discover what its measurements are: which observations live on cells, which are intensive or exte...

By Linzhe Zhang, Changming Xu
arXiv Machine Learning
Oct 8

Identifiability of a dissipative knowledge-dynamics model: exact recovery under designed excitation, degeneration on observational data

The paper presents a nonlinear dissipative dynamical model of human learning, featuring a concept‑transfer matrix, per‑concept forgetting rates, and a saturating practice‑response gain. It proves a structural identifiability theorem that guarantees exact parameter recovery under explicit excitation conditions, provides closed‑form recovery for the two‑concept case, and introduces a fast, L‑stable numerical scheme enabling estimation on large learner cohorts. Empirical results show exact recovery on synthetic data with designed excitation, but failure to recover on large observational benchmarks, illustrating a sharp boundary between identifiable and unidentifiable regimes and offering a validation protocol for interpretability claims.

By Arman Kostanian, Armen Beklaryan
Hugging Face Trending Papers
Oct 8

LLM-IDEA: Identifiability-Driven Experimental Agent for Autonomous Discovery of Mechanistic World Models

LLM-IDEA is an identifiability‑driven experimental agent that guides large language model scientists in autonomous discovery of mechanistic world models. It evaluates whether a plateau in learning is due to the agent’s capability limits, the model’s resolvability within the design class, or a certified exhaustion of the experiment space. The system demonstrates its effectiveness across benchmarks such as ODEBench, DiscoverPhysics, and a custom Alien Universe testbed, consistently identifying when additional experiments are futile and when new experimental designs are required.

arXiv AI
Oct 9

LLM-IDEA: Identifiability-Driven Experimental Agent for Autonomous Discovery of Mechanistic World Models

The paper introduces LLM-IDEA, an identifiability‑driven experimental agent that guides large language model scientists in closed‑loop discovery of mechanistic world models. It incorporates an identifiability engine that classifies experimental plateaus as capability limits, resolvable within the design class, or certified exhausted, and demonstrates its effectiveness on benchmarks such as ODEBench, DiscoverPhysics, and a custom Alien Universe testbed. The agent’s ability to distinguish when further experimentation is futile versus when new designs are needed improves the efficiency and reliability of autonomous scientific discovery.

By Surya Shetty, Ulisses Braga-Neto
arXiv AI
5d ago

Same Behavior, Different Mechanism: What Finite Experiments Can Certify About Integrated Information

The paper investigates when the integrated information measure ζ (phi) can be reliably identified from finite, noisy experiments in small stochastic networks. It shows that even identical input‑output behavior can hide large differences in phi, that partial recordings impose hard precision limits, and that phi is highly sensitive to infinitesimal mechanism changes, often misreported by surrogate models. The authors prove that a lower bound on phi can be certified with controlled experiments and quantify the sample size needed for statistical confidence.

By Linqian Wu, Diaoxuan He
arXiv AI
Oct 26

Minimum Description Length Unsupervisedly Separates Law-Grade from Statistical-Grade Knowledge in a Self-Improving Science Agent - and Reveals 86% of Its Own Discoveries Are Statistical

The paper reports on a self‑improving science agent that has admitted 252 scientific relations and uses Minimum Description Length (MDL) compression ratios as an unsupervised epistemic grader. The MDL‑ranked top discoveries match canonical physical laws (e.g., vis‑vis‑a, Balmer/Rydberg) with strong statistical enrichment and no counterexamples, while 86 % of the agent’s ledger entries compress poorly (cr≈1) and are identified as statistical regularities rather than true laws. The study introduces a dual‑axis bookkeeping system separating prediction value (R²) from compression value (cr), demonstrates its robustness, and presents falsifiable predictions.

By Wenbin Mao, Pei Zou
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
arXiv AI
Sep 25

Certified Task-Conditioned Active Observability

The paper introduces the concept of task‑conditioned active observability, defining the minimal interaction cost needed for an autonomous agent to identify task‑relevant states while guaranteeing safe abstention. It formalizes this complexity, proving that task‑predictive equivalence yields a unique minimal sufficient quotient that preserves complexity and eliminates unnecessary distinctions. The authors present theoretical characterizations for deterministic and noisy regimes, and demonstrate a certified observer that reduces sensor usage and model steps while maintaining zero false acceptances in extensive high‑dimensional trials.

By Linzhe Zhang, Changming Xu