Skip to content
DraconiticResearch
Search Sources API
186,123 studies31 sourcesUpdated 25 min ago
PreprintCC BY 4.0arXiv

Pro-Active Inference

Abstract

Estimating a population mean is fundamental across scientific applications, but observing every outcome can be prohibitively expensive. Often, covariates and machine learning (ML) predictions are available for the full population, even when only a small subset of outcomes can be observed. How can we leverage this information to proactively select observations to label, update ML predictions as labels arrive, and construct statistically valid confidence intervals? We develop a general, without-replacement formulation of Pro-Active Inference (PAI), extending our earlier with-replacement approach and building on Active Statistical Inference. Rather than making fixed-order label-skip decisions, PAI proactively selects which observation to label next from the remaining covariate pool while accommodating online ML updates. We establish PAI's finite-sample unbiasedness and asymptotic validity, develop an improved finite-sample variance estimator, and extend PAI to superpopulation inference without Bonferroni corrections or α-splitting. We characterize PAI's potential efficiency gains over Batch Active Inference in a quasi-oracle setting, highlighting the role of prediction-residual imbalance. Across eight diverse datasets, PAI achieves greater sampling efficiency than Sequential Active Inference in the vast majority of tested settings with near-nominal statistical coverage, using the same ML predictor and uncertainty score. However, comparisons with simpler baselines such as Prediction-Powered Inference and uniform sampling, as well as the closely related Prediction-Powered Active Testing, reveal when additional adaptivity helps or hurts statistical efficiency. Through interpretable, theory-motivated diagnostics and frozen-ML ablations, we investigate when and why PAI gains or loses efficiency, highlighting the initial residual-estimation problem and subsequent online learning dynamics.

Related

  1. Active Inference as a Convex Markov Decision Process
    Nikola Milosevic, Nicolás Hinrichs, Nico Scherf
    arXivPreprintCC BY 4.0Full textStatisticsarXiv
  2. Learning U-Statistics with Active Inference
    Xiaoning Wang, Yuyang Huo, Liuhua Peng +1
    arXivPreprintarXiv licenceFull textStatisticsarXiv
  3. Compressed Active Subspaces for Scalable Bayesian Inference
    Thomas Flynn, Sanket Jantre, Byung-Jun Yoon +1
    arXivPreprintCC BY 4.0Full textStatisticsarXiv
  4. What Information Buys in Active Inference
    Melih Kandemir, Mustafa Mert Çelikok
    arXivPreprintCC BY 4.0Full textStatisticsarXiv
  5. Physics of Information Geometry - Part II: Small-Step Active Inference on the Probability Simplex
    C. Emre Koksal, Deniz Sargun
    arXivPreprintarXiv licenceFull textGeneral mathematicsStatistical & nonlinear physicsarXiv
BibTeX
@misc{wu2026proactive,
  title = {{Pro-Active Inference}},
  author = {Skyler Wu and Yash Nair and Antoine Maechler and Emmanuel J. Candès},
  howpublished = {arXiv},
  year = {2026},
  month = oct,
  doi = {10.48550/arxiv.2610.34681},
  eprint = {2610.34681},
  archivePrefix = {arXiv},
  url = {https://arxiv.org/abs/2610.34681},
  note = {CC BY 4.0},
}
RIS
TY  - UNPB
TI  - Pro-Active Inference
AU  - Skyler Wu
AU  - Yash Nair
AU  - Antoine Maechler
AU  - Emmanuel J. Candès
PY  - 2026
DA  - 2026/10/26
PB  - arXiv
DO  - 10.48550/arxiv.2610.34681
UR  - https://arxiv.org/abs/2610.34681
AB  - Estimating a population mean is fundamental across scientific applications, but observing every outcome can be prohibitively expensive. Often, covariates and machine learning (ML) predictions are available for the full population, even when only a small subset of outcomes can be observed. How can we leverage this information to proactively select observations to label, update ML predictions as labels arrive, and construct statistically valid confidence intervals? We develop a general, without-replacement formulation of Pro-Active Inference (PAI), extending our earlier with-replacement approach and building on Active Statistical Inference. Rather than making fixed-order label-skip decisions, PAI proactively selects which observation to label next from the remaining covariate pool while accommodating online ML updates. We establish PAI's finite-sample unbiasedness and asymptotic validity, develop an improved finite-sample variance estimator, and extend PAI to superpopulation inference without Bonferroni corrections or α-splitting. We characterize PAI's potential efficiency gains over Batch Active Inference in a quasi-oracle setting, highlighting the role of prediction-residual imbalance. Across eight diverse datasets, PAI achieves greater sampling efficiency than Sequential Active Inference in the vast majority of tested settings with near-nominal statistical coverage, using the same ML predictor and uncertainty score. However, comparisons with simpler baselines such as Prediction-Powered Inference and uniform sampling, as well as the closely related Prediction-Powered Active Testing, reveal when additional adaptivity helps or hurts statistical efficiency. Through interpretable, theory-motivated diagnostics and frozen-ML ablations, we investigate when and why PAI gains or loses efficiency, highlighting the initial residual-estimation problem and subsequent online learning dynamics.
ER  -