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

• URL: http://arxiv.org/abs/2608.00591v2
• Date: Sat, 08 Aug 2026 09:51:31 GMT
• Title: Why Does the Future Branch? Identifiable Closure Tests for Stochastic Physical World Models
• Abstract summary: ClosurePairs crosses compatible microstates with repeated disturbances.<n>It recovers source attribution at unchanged likelihood.<n>It reduces equal-budget decomposition error in a nonlinear interaction benchmark.
• Score: 0.0
• License: http://creativecommons.org/licenses/by-nc-nd/4.0/
• Abstract: A calibrated stochastic world model can reveal how uncertain a future is without revealing why it branches. The same conditional future law can arise because an observation aliases physical states or because dynamics remain random after the declared full state is fixed. We prove that ordinary transitions cannot identify these two sources, even for a perfect probabilistic predictor. ClosurePairs makes them identifiable by crossing compatible microstates with repeated exogenous disturbances and estimating state, noise, and state-noise interaction variance. The central consequence is operational: under finite hierarchical sampling, forecast difficulty governs the useful compute scale, while the alias/process composition provides complementary information about its direction-resolving the current state or sampling future randomness. ClosurePairs recovers source attribution at unchanged likelihood, reduces equal-budget decomposition error in a nonlinear interaction benchmark, and supports observation-only routing. On exact-marginal MetaWorld twins, an output-only allocator is at chance while a Closure-supervised probe on frozen JEPA-WM features routes 89.8-100%. In an independent ManiSkill PushCube confirmation, a stochastic RSSM's outputs and latents remain at chance, whereas an RGB-only Closure probe routes 100% under both ID and geometry/camera OOD over five seeds, matching direct allocation rather than exceeding it. Across five unseen allocation menus, the same Closure probe routes 92.5%/90.4% ID/OOD with no new oracle labels, versus 37.9%/32.9% for a frozen direct allocator. ClosurePairs is therefore an identifiable, reusable mechanism target that cannot be recovered from forecast quality alone.

Related papers

• Counterfactual Evaluation of Temporal Observation Protocols [1.2292186162350942]
  We study whether data collected under a realised observation protocol determine the predictive value of alternatives that were never deployed.<n>We show that even infinite benchmark data need not determine this value.<n>We develop a value-specific identification theory in which only latent ambiguity that changes the alternative's value matters.
  arXiv  Detail & Related papers  (2026-08-23T05:05:16Z)
• Scale-Consistent Posterior Dynamics for Diffusion Inverse Problems [16.685352002333225]
  Posterior sampling with a pretrained diffusion prior is governed by a conditional score whose likelihood component is generally intractable.<n>We show that a noise-conditioned path whose targets approach the clean posterior produces a continuous surrogate SDE.<n>Experiments on FFHQ and ImageNet with 100 score evaluations demonstrate competitive reconstruction fidelity for superresolution and deblurring.
  arXiv  Detail & Related papers  (2026-08-15T09:38:41Z)
• Distributionally Faithful Imputation via Positive Semi-Definite Kernel Density Estimation [55.47411235954028]
  We recast imputation under missing completely at random as density estimation from masked observations.<n>We obtain a convex empirical risk problem with closed form marginals, solvable by a Newton interior point method.<n>The resulting PSD Impute model yields both single and multiple imputations from the same fitted density.
  arXiv  Detail & Related papers  (2026-07-08T15:51:05Z)
• Interpretable Uncertainty Routing Separating Emotion Ambiguity from Distribution Shift in Facial Expression Recognition [0.0]
  Uncertainty-Aware Routing (UAR) is an inference-time routing mechanism that exploits the separation between ambiguity and shift.<n>A proposed dual-validation protocol reveals that aleatoric recovers annotator disagreement with Spearman correlation.<n>UAR retains approximately 1.8 times more ambiguous in-distribution faces than single-uncertainty routing at a matched out-of-distribution rejection rate.
  arXiv  Detail & Related papers  (2026-06-21T23:54:44Z)
• ARC: Adaptive Robust Joint State and Covariance Estimation [42.045109659898465]
  Sensor measurements are frequently corrupted by outliers and non-Gaussian noise.<n>These imperfections in the sensor data can cause classical state estimators to generate biased and unreliable state and uncertainty estimates.<n>This paper proposes a unified Block-Coordinate Descent framework that combines a norm-aware adaptive robust loss, and an Iteratively Reweighted Least-Squares state update.
  arXiv  Detail & Related papers  (2026-06-18T16:09:50Z)
• Nous: An Attempt to Extract and Inject the Cognition Behind Prediction-Market Behavior [0.0]
  We ask whether human cognitive diversity can be recovered from behavior and transferred to LLM agents.<n>Nous extracts a structured eight-dimension behavioral profile from real Polymarket trading activity and injects it into agents through prompts.<n>We position Nous as measuring the cognitive-monoculture problem and the limits of a prompt-level remedy.
  arXiv  Detail & Related papers  (2026-06-11T08:18:25Z)
• Ternary Decision Trees with Locally-Adaptive Uncertainty Zones [0.0]
  ternary decision trees augment each split node with an uncertainty zone of half-width delta centered on the optimal threshold.<n> delta is computed locally at each node from statistics already available during standard CART split finding.<n>We evaluate five delta-estimation methods: quality-plateau, class-overlap, gain-ratio, node-bootstrap and margin.
  arXiv  Detail & Related papers  (2026-05-21T17:11:19Z)
• Reading Calibrated Uncertainty from Language Model Trajectories [46.663987199083245]
  Methods that probe the model's internal activations feed raw hidden states into opaque snapshots and leave implicit the layer-wise trajectory by which a representation is formed.<n>We extract eleven scale-invariant geometric features, tracing the cumulative path of per-layer updates, and feed them to a sparse linear probe.<n>The probe outperforms MSP under selective abstention, with baseline scaling with up to 21 AURC points.
  arXiv  Detail & Related papers  (2026-05-19T19:24:29Z)
• PAIR-CI: Calibrated Conditional Independence Testing for Causal Discovery with Incomplete Data [0.0]
  We introduce PAIR-CI, a nonparametric conditional independence (CI) test that restores calibration by integrating multiple imputation directly into the inferential procedure.<n>A provably consistent variance estimator jointly accounts for uncertainty arising from cross-validation and multiple imputation.
  arXiv  Detail & Related papers  (2026-05-06T12:34:37Z)
• High-Dimensional Gaussian Mean Estimation under Realizable Contamination [43.56842719227285]
  We study mean estimation for a Gaussian distribution with identity covariance in $mathbbRd$ under a missing data scheme termed realizable $$-contamination model.<n>In this model an adversary can choose a function $r(x)$ between 0 and $$ and each sample $x$ goes missing with probability $r(x)$.
  arXiv  Detail & Related papers  (2026-03-17T17:04:18Z)
• TRIAGE: Type-Routed Interventions via Aleatoric-Epistemic Gated Estimation in Robotic Manipulation and Adaptive Perception -- Don't Treat All Uncertainty the Same [2.755751829139168]
  Most uncertainty-aware robotic systems collapse prediction uncertainty into a single scalar score and use it to trigger uniform corrective responses.<n>This aggregation obscures whether uncertainty arises from corrupted observations or from mismatch between the learned model and the true system dynamics.<n>We introduce a lightweight post hoc framework that decomposes uncertainty into aleatoric and epistemic components and uses these signals to regulate system responses at inference time.
  arXiv  Detail & Related papers  (2026-03-09T09:07:43Z)
• Fixed-Horizon Self-Normalized Inference for Adaptive Experiments via Martingale AIPW/DML with Logged Propensities [0.0]
  Under adaptive assignment, propensities can keep changing, so the predictable quadratic variation of AIPW/DML increments may remain random.<n>We show that the Studentized statistic, with variance estimated by realized quadratic variation, is conditionally miscalibrated even without variance stabilization.
  arXiv  Detail & Related papers  (2026-02-17T13:12:31Z)
• Decomposing Uncertainty in Probabilistic Knowledge Graph Embeddings: Why Entity Variance Is Not Enough [0.0]
  Probabilistic knowledge graph embeddings represent entities as distributions, using learned variances to quantify uncertainty.<n>These variances are relation-agnostic, meaning an entity receives identical uncertainty regardless of relational context.<n>We prove an impossibility result: any uncertainty estimator using only entity-level statistics independent of relation context achieves near-random OOD detection on novel contexts.
  arXiv  Detail & Related papers  (2025-12-26T12:38:43Z)
• Lazy Layers to Make Fine-Tuned Diffusion Models More Traceable [70.77600345240867]
  A novel arbitrary-in-arbitrary-out (AIAO) strategy makes watermarks resilient to fine-tuning-based removal. Unlike the existing methods of designing a backdoor for the input/output space of diffusion models, in our method, we propose to embed the backdoor into the feature space of sampled subpaths. Our empirical studies on the MS-COCO, AFHQ, LSUN, CUB-200, and DreamBooth datasets confirm the robustness of AIAO.
  arXiv  Detail & Related papers  (2024-05-01T12:03:39Z)
• Efficient and Sharp Off-Policy Evaluation in Robust Markov Decision Processes [44.974100402600165]
  We study the evaluation of a policy best-parametric and worst-case perturbations to a decision process (MDP) We use transition observations from the original MDP, whether they are generated under the same or a different policy. Our estimator is also estimated statistical inference using Wald confidence intervals.
  arXiv  Detail & Related papers  (2024-03-29T18:11:49Z)
• Optimized experiment design and analysis for fully randomized benchmarking [34.82692226532414]
  We investigate the advantages of fully randomized benchmarking, where a new random sequence is drawn for each experimental trial. The advantages of full randomization include smaller confidence intervals on the inferred step error. We experimentally observe such improvements in Clifford randomized benchmarking experiments on a single trapped ion qubit.
  arXiv  Detail & Related papers  (2023-12-26T00:41:47Z)
• Near-Optimal Non-Parametric Sequential Tests and Confidence Sequences with Possibly Dependent Observations [44.71254888821376]
  We provide the first type-I-error and expected-rejection-time guarantees under general non-data generating processes. We show how to apply our results to inference on parameters defined by estimating equations, such as average treatment effects.
  arXiv  Detail & Related papers  (2022-12-29T18:37:08Z)
• Dense Uncertainty Estimation via an Ensemble-based Conditional Latent Variable Model [68.34559610536614]
  We argue that the aleatoric uncertainty is an inherent attribute of the data and can only be correctly estimated with an unbiased oracle model. We propose a new sampling and selection strategy at train time to approximate the oracle model for aleatoric uncertainty estimation. Our results show that our solution achieves both accurate deterministic results and reliable uncertainty estimation.
  arXiv  Detail & Related papers  (2021-11-22T08:54:10Z)
• The Hidden Uncertainty in a Neural Networks Activations [105.4223982696279]
  The distribution of a neural network's latent representations has been successfully used to detect out-of-distribution (OOD) data. This work investigates whether this distribution correlates with a model's epistemic uncertainty, thus indicating its ability to generalise to novel inputs.
  arXiv  Detail & Related papers  (2020-12-05T17:30:35Z)
• Localization Uncertainty Estimation for Anchor-Free Object Detection [48.931731695431374]
  There are several limitations of the existing uncertainty estimation methods for anchor-based object detection. We propose a new localization uncertainty estimation method called UAD for anchor-free object detection. Our method captures the uncertainty in four directions of box offsets that are homogeneous, so that it can tell which direction is uncertain.
  arXiv  Detail & Related papers  (2020-06-28T13:49:30Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.