mlsanityData to 7 Oct 2026

Counterfactual Evaluation of Temporal Observation Protocols

arXiv 2608.22221 ↗First posted 23 Aug 2026cs.LGcited by 0

Not on the map. Why?

Abstract (arXiv)

We study counterfactual protocol evaluation: whether data collected under a realised observation protocol determine the predictive value of alternatives that were never deployed. Protocol value is the population R2 of the Bayes-optimal predictor of a fixed trajectory-level target from the measurements an alternative would collect. We show that even infinite benchmark data need not determine this value: distinct latent covariance structures can induce the same benchmark measurement--target law while assigning different values to the same alternative. We develop a value-specific identification theory in which only latent ambiguity that changes the alternative's value matters. For linear targets, invisible covariance directions certify non-identification, while targeted measurements can restore identification without recovering the full latent covariance; an exact permutation construction extends the result to nonlinear aggregate targets. With finite dense calibration data, uniform error bounds control protocol-selection regret and distinguishable value gaps. Exact marginal gains then support cost-constrained, target-aware observation design. Simulations and retrospective analyses of Sleep-EDF and Long-Term AF show that broad temporal-layout differences can be more reliably distinguished than fine placements selected from finite data. Together, these results connect identification, calibration resolution and observation design for undeployed protocols.

Key facts. No citing papers in the map yet (data through 7 Oct 2026). Builds on 16 of its 62 references that are in the map. First posted on arXiv 23 Aug 2026.

Builds on

16 of 62 references.

References · 16

  1. 2016Recurrent Neural Networks for Multivariate Time Series with Missing Valuescited by 548
  2. 2020Neural Controlled Differential Equations for Irregular Time Seriescited by 501
  3. 2015On the Equivalence between Kernel Quadrature Rules and Random Feature Expansionscited by 136
  4. 2023Modern Bayesian Experimental Designcited by 121
  5. 2019Double Reinforcement Learning for Efficient Off-Policy Evaluation in Markov Decision Processescited by 118
  6. 2015External Validity: From Do-Calculus to Transportability Across Populationscited by 75
  7. 2020Off-policy Bandits with Deficient Supportcited by 60
  8. 2018Graphical Models for Processing Missing Datacited by 57
  9. 2020A Survey on Principles, Models and Methods for Learning from Irregularly Sampled Time Seriescited by 42
  10. 2015Probabilistic Integration: A Role in Statistical Computation?cited by 26
  11. 2020Full Law Identification In Graphical Models Of Missing Data: Completeness Resultscited by 26
  12. 2022Is the Performance of My Deep Network Too Good to Be True? A Direct Approach to Estimating the Bayes Error in Binary Classificationcited by 24
4 more
  1. 2018Goal-Oriented Optimal Design of Experiments for Large-Scale Bayesian Linear Inverse Problemscited by 19
  2. 2023Evaluation of Active Feature Acquisition Methods for Time-varying Feature Settingscited by 9
  3. 2016Optimal Designs for Longitudinal and Functional Datacited by 2
  4. 2026The Label Defines the Timescale: Trait-State Limits of Temporal-Aggregate Learningcited by 1

Built on by

Not cited yet.