Table of Contents
Fetching ...

Anytime-valid, Bayes-assisted, Prediction-Powered Inference

Valentin Kilian, Stefano Cortinovis, François Caron

TL;DR

This work tackles valid sequential inference under a large unlabeled data pool and predictive auxiliary information by extending Prediction-Powered Inference (PPI) to anytime-valid confidence sequences. It develops asymptotic confidence sequences (AsympCS) using Ville's inequality and the method of mixtures, and enhances them with Bayes-assisted priors on the rectifier $\Delta_\theta$, yielding time-uniform CIs that shrink when predictions align with reality. The paper provides asymptotic results for both standard PPI and PPI++ estimators, proves asymptotic Type-I error control, and demonstrates how control variates and strong coupling underpin the theory. Empirical results on synthetic and real datasets show consistent gains in efficiency over classical inference, with Bayes-assisted PPI offering additional gains when predictor quality is favorable and robustness when priors are misspecified.

Abstract

Given a large pool of unlabelled data and a smaller amount of labels, prediction-powered inference (PPI) leverages machine learning predictions to increase the statistical efficiency of confidence interval procedures based solely on labelled data, while preserving fixed-time validity. In this paper, we extend the PPI framework to the sequential setting, where labelled and unlabelled datasets grow over time. Exploiting Ville's inequality and the method of mixtures, we propose prediction-powered confidence sequence procedures that are asymptotically valid uniformly over time and naturally accommodate prior knowledge on the quality of the predictions to further boost efficiency. We carefully illustrate the design choices behind our method and demonstrate its effectiveness in real and synthetic examples.

Anytime-valid, Bayes-assisted, Prediction-Powered Inference

TL;DR

This work tackles valid sequential inference under a large unlabeled data pool and predictive auxiliary information by extending Prediction-Powered Inference (PPI) to anytime-valid confidence sequences. It develops asymptotic confidence sequences (AsympCS) using Ville's inequality and the method of mixtures, and enhances them with Bayes-assisted priors on the rectifier , yielding time-uniform CIs that shrink when predictions align with reality. The paper provides asymptotic results for both standard PPI and PPI++ estimators, proves asymptotic Type-I error control, and demonstrates how control variates and strong coupling underpin the theory. Empirical results on synthetic and real datasets show consistent gains in efficiency over classical inference, with Bayes-assisted PPI offering additional gains when predictor quality is favorable and robustness when priors are misspecified.

Abstract

Given a large pool of unlabelled data and a smaller amount of labels, prediction-powered inference (PPI) leverages machine learning predictions to increase the statistical efficiency of confidence interval procedures based solely on labelled data, while preserving fixed-time validity. In this paper, we extend the PPI framework to the sequential setting, where labelled and unlabelled datasets grow over time. Exploiting Ville's inequality and the method of mixtures, we propose prediction-powered confidence sequence procedures that are asymptotically valid uniformly over time and naturally accommodate prior knowledge on the quality of the predictions to further boost efficiency. We carefully illustrate the design choices behind our method and demonstrate its effectiveness in real and synthetic examples.

Paper Structure

This paper contains 73 sections, 25 theorems, 153 equations, 15 figures, 1 table.

Key Result

Theorem 1

Let $(Y_t)_{t\geq 1}$ be a sequence of i.i.d. random variables with mean $\mu$ and such that $\mathbb E\vert Y_1\vert^{2+\delta}<\infty$ for some $\delta>0$. For any $t\geq 1$, let $\overline Y_t$ be the sample mean, and $\widehat{\sigma}_t^2$ be the sample variance based on the first $t$ observati forms a $(1-\alpha)$--AsympCS with approximation rate $1/\sqrt{t\log{t}}$ for $\mu$.

Figures (15)

  • Figure 1: Noisy predictions study. The left, middle and right panels show average interval volume over $1000$ repetitions as a function of the labelled sample size $n$ for noise levels $\sigma_Y \in \{0.1, 0.8, 3.0\}$.
  • Figure 2: Biased predictions study. The left, middle and right panels show average interval volume over $100$ repetitions as a function of the bias level $\upsilon$ for $\mathrm{df} = 5, 10, \infty$.
  • Figure 3: Mean estimation. The top and bottom rows show the average interval volume and cumulative miscoverage rate over $1000$ repetitions for the flights, forest, and galaxies datasets.
  • Figure S4: Comparison of fixed-time confidence intervals (CIs) and a confidence sequence (CS) for data from $\mathcal{N}(0,1)$. Two fixed-time CIs at different sample sizes happen to be disjoint (highlighted), illustrating that marginal coverage at each $t$ does not imply simultaneous coverage over $t$. The CS is more conservative at small $t$, but its coverage holds uniformly over all $t$.
  • Figure S5: Noisy predictions study. The left, middle and right panels show average interval volume and cumulative miscoverage rate over $1000$ repetitions for noise levels $\sigma_Y = 0.1, 0.8, 3.0$.
  • ...and 10 more figures

Theorems & Definitions (35)

  • Definition 1: Confidence sequence
  • Definition 2: Asymptotic confidence sequence
  • Theorem 1
  • Theorem 2
  • Theorem 3: Bayes-assisted AsympCS -- i.i.d. case
  • Theorem 4: Asymptotic Bayes-assisted CS -- non-i.i.d. case
  • Theorem 5: Asymptotic Type-I error control
  • Proposition 1: Asymptotics for CVEs
  • Proposition 2: KMT coupling for CVEs
  • Proposition 3
  • ...and 25 more