Multi-Distribution Robust Conformal Prediction
Yuqi Yang, Ying Jin

TL;DR
This paper develops a method for constructing conformal prediction sets that maintain coverage guarantees across multiple heterogeneous distributions, addressing challenges in fairness, robustness, and multi-source learning.
Contribution
It introduces a max-p aggregation scheme for multi-distribution conformal prediction, proving its optimality and providing algorithms for efficient, robust prediction sets.
Findings
Guarantees uniform coverage across multiple distributions
Reduces prediction set size compared to naive methods
Achieves comparable size to single-source prediction sets
Abstract
In many fairness and distribution robustness problems, one has access to labeled data from multiple source distributions yet the test data may come from an arbitrary member or a mixture of them. We study the problem of constructing a conformal prediction set that is uniformly valid across multiple, heterogeneous distributions, in the sense that no matter which distribution the test point is from, the coverage of the prediction set is guaranteed to exceed a pre-specified level. We first propose a max-p aggregation scheme that delivers finite-sample, multi-distribution coverage given any conformity scores associated with each distribution. Upon studying several efficiency optimization programs subject to uniform coverage, we prove the optimality and tightness of our aggregation scheme, and propose a general algorithm to learn conformity scores that lead to efficient prediction sets after…
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.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsEthics and Social Impacts of AI · Domain Adaptation and Few-Shot Learning · Adversarial Robustness in Machine Learning
