🤖 AI Summary
This work addresses the lack of theoretical guarantees on training-conditional coverage—i.e., coverage under the training data distribution—of conformal prediction under covariate shift. We first systematically investigate its upper-bound characterization and controllability. We derive a weighted Dvoretzky–Kiefer–Wolfowitz inequality to establish tight, provable training-conditional coverage bounds for split conformal prediction under nearly assumption-free conditions. Furthermore, leveraging algorithmic uniform stability, we provide the first training-conditional coverage guarantees for full conformal and jackknife+ methods. Our results demonstrate that all three mainstream conformal prediction frameworks achieve controllable training-conditional coverage under covariate shift, with split conformal yielding bounds that are both minimally assumption-dependent and tight. This work fills a critical theoretical gap in conditional coverage analysis of conformal prediction beyond the i.i.d. setting.
📝 Abstract
Training-conditional coverage guarantees in conformal prediction concern the concentration of the error distribution, conditional on the training data, below some nominal level. The conformal prediction methodology has recently been generalized to the covariate shift setting, namely, the covariate distribution changes between the training and test data. In this paper, we study the training-conditional coverage properties of a range of conformal prediction methods under covariate shift via a weighted version of the Dvoretzky-Kiefer-Wolfowitz (DKW) inequality tailored for distribution change. The result for the split conformal method is almost assumption-free, while the results for the full conformal and jackknife+ methods rely on strong assumptions including the uniform stability of the training algorithm.