Batch Multivalid Conformal Prediction
Christopher Jung, Georgy Noarov, Ramya Ramalingam, Aaron Roth

TL;DR
This paper introduces two fast algorithms for multivalid conformal prediction that provide stronger, group-conditional coverage guarantees in batch settings, applicable to arbitrary predictors and group structures.
Contribution
The paper presents two novel algorithms, BatchGCP and BatchMVP, that extend conformal prediction to achieve multivalid coverage guarantees with efficient computation.
Findings
Both algorithms provide group-conditional coverage guarantees.
BatchGCP requires solving a single convex optimization problem.
BatchMVP offers full multivalid guarantees through an iterative process.
Abstract
We develop fast distribution-free conformal prediction algorithms for obtaining multivalid coverage on exchangeable data in the batch setting. Multivalid coverage guarantees are stronger than marginal coverage guarantees in two ways: (1) They hold even conditional on group membership -- that is, the target coverage level holds conditionally on membership in each of an arbitrary (potentially intersecting) group in a finite collection of regions in the feature space. (2) They hold even conditional on the value of the threshold used to produce the prediction set on a given example. In fact multivalid coverage guarantees hold even when conditioning on group membership and threshold value simultaneously. We give two algorithms: both take as input an arbitrary non-conformity score and an arbitrary collection of possibly intersecting groups , and then…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Code & Models
Videos
Taxonomy
TopicsStatistical Methods and Inference · Domain Adaptation and Few-Shot Learning · Bone and Joint Diseases
