WorldKernel: A World Model is the Coupling Kernel of Admissible Possible Worlds
TLDR
Defines a world model as a coupling kernel over possible worlds, revealing predictor failures on counterfactual couplings and providing bounds via positive semidefiniteness.
Reasoning
Strengths include a novel theoretical framework linking world models to coupling kernels and addressing a fundamental limitation of predictors in counterfactual reasoning. Weaknesses are the dense abstract lacking clarity on practical implications and limited detail on empirical evaluation.
Read-first score
Read-first score 47.5, weighted from topical fit, citation, graph, method, reproducibility, and recency signals. Original total remains 21.
Field roles
Rank sensitivity
Stability: volatile; rank range: 408.
Keyword Scores
Deep Analysis
Innovations
- Identifying a failure mode where strong predictors and Bayesian baselines fail on unidentified quantities (counterfactual couplings) despite succeeding on identified quantities.
- Proposing a world model as a positive semidefinite coupling kernel over admissible worlds, with off-diagonal representing cross-world coupling.
- Showing that positive semidefiniteness provides partial-identifying information that bounds counterfactuals in polynomial time.
- Using logical structure (ontology axioms) to tighten bounds by up to a third.
- Acquiring targeted scars (constraints from encountered infeasibilities) to close the gap several times faster than untargeted ones.
- Full reconstruction via approximate counting of admissible worlds, tractable below the Sly-Sun threshold.
Methodology
The paper uses hundreds of structural causal models to test a strong predictor and a Bayesian baseline on identified and unidentified quantities. It proposes a world model as a positive semidefinite coupling kernel K(T,T') over admissible worlds, where the diagonal is the ordinary posterior and the off-diagonal is the cross-world coupling. The method enforces positive semidefiniteness to bound counterfactuals in polynomial time, uses ontology axioms to tighten bounds, and learns targeted scars from encountered infeasibilities to accelerate convergence. Full reconstruction is done via approximate counting of admissible worlds, with tractability analyzed relative to the Sly-Sun threshold.
Key Results
On identified quantities, both the strong predictor and Bayesian baseline succeed, but on unidentified quantities (couplings between counterfactual worlds) the predictor collapses to a point, on 28% of models to an invalid point, while the truth is an admissible interval that more data never narrows. Enforcing positive semidefiniteness bounds counterfactuals in polynomial time, ontology axioms tighten bounds by up to a third, and targeted scars close the gap several times faster than untargeted ones.
Limitations
- Full reconstruction is approximate counting of admissible worlds, tractable only below the Sly-Sun threshold and inapproximable above; the paper does not claim to beat the worst case.
- The gap is structural: prediction cannot represent uncertainty over counterfactual couplings, which is a fundamental limitation of standard predictors.