Conformal Prediction With Conditional Guarantees
Isaac Gibbs, John J. Cherian, Emmanuel J. Candès
TL;DR
This work tackles distribution-free prediction with finite-sample conditional guarantees by reframing exact conditional coverage as coverage over a class of covariate shifts. It develops a general, calibration-based framework that extends split conformal prediction to finite-dimensional and infinite-dimensional function classes, achieving exact group-conditional and covariate-shift guarantees for finite-dimensional F and providing finite-sample error bounds for infinite-dimensional F (e.g., RKHS or Lipschitz classes). The proposed method integrates with black-box models via augmented quantile regression, employs a dual formulation for efficient computation, and delivers practical guidance through real-data experiments (Communities and Crime, RxRx1) with comparisons to CQR and localized conformal prediction. The results offer a controllable, distribution-free approach to quantify and manage uncertainty in modern predictive pipelines, even under distributional shifts.
Abstract
We consider the problem of constructing distribution-free prediction sets with finite-sample conditional guarantees. Prior work has shown that it is impossible to provide exact conditional coverage universally in finite samples. Thus, most popular methods only guarantee marginal coverage over the covariates or are restricted to a limited set of conditional targets, e.g. coverage over a finite set of pre-specified subgroups. This paper bridges this gap by defining a spectrum of problems that interpolate between marginal and conditional validity. We motivate these problems by reformulating conditional coverage as coverage over a class of covariate shifts. When the target class of shifts is finite-dimensional, we show how to simultaneously obtain exact finite-sample coverage over all possible shifts. For example, given a collection of subgroups, our prediction sets guarantee coverage over each group. For more flexible, infinite-dimensional classes where exact coverage is impossible, we provide a procedure for quantifying the coverage errors of our algorithm. Moreover, by tuning interpretable hyperparameters, we allow the practitioner to control the size of these errors across shifts of interest. Our methods can be incorporated into existing split conformal inference pipelines, and thus can be used to quantify the uncertainty of modern black-box algorithms without distributional assumptions.
