Conformal Prediction Adaptive to Unknown Subpopulation Shifts
Nien-Shao Wang, Duygu Nur Yaldiz, Yavuz Faruk Bakman, Sai Praneeth Karimireddy

TL;DR
This paper develops methods for conformal prediction that adapt to unknown subpopulation shifts, maintaining valid uncertainty quantification even without explicit subpopulation labels, and demonstrates their effectiveness on vision and language models.
Contribution
It introduces new algorithms that adapt conformal prediction to unknown subpopulation shifts without requiring subpopulation labels, ensuring valid coverage in complex scenarios.
Findings
Methods reliably maintain coverage under subpopulation shifts.
Algorithms scale to high-dimensional, real-world tasks.
Experiments show improved risk control compared to standard conformal prediction.
Abstract
Conformal prediction is widely used to equip black-box machine learning models with uncertainty quantification, offering formal coverage guarantees under exchangeable data. However, these guarantees fail when faced with subpopulation shifts, where the test environment contains a different mix of subpopulations than the calibration data. In this work, we focus on unknown subpopulation shifts where we are not given group-information i.e. the subpopulation labels of datapoints have to be inferred. We propose new methods that provably adapt conformal prediction to such shifts, ensuring valid coverage without explicit knowledge of subpopulation structure. While existing methods in similar setups assume perfect subpopulation labels, our framework explicitly relaxes this requirement and characterizes conditions where formal coverage guarantees remain feasible. Further, our algorithms scale to…
Peer Reviews
Decision·Submitted to ICLR 2026
1. This work addresses a relevant and underexplored problem of adapting conformal prediction to unknown subpopulation shifts. 2. The theoretical results are clear and intuitive. 3. This paper provides a clear motivation. 4. The proposed approach is relevant to a wide range of tasks, from ImageNet to LLM hallucinations.
1. The theoretical guarantee of Theorem 3.3 relies on a strong assumption of having perfect or multicalibrated domain classifiers. 2. This work does not analyze what happens when the domain classifier is not multiaccurate and provides no empirical or theoretical results for this case. 3. Algorithm 3, which handles the most realistic setting with no domain labels, is purely heuristic and lacks theoretical or empirical motivation. 4. This paper should compare the proposed approach to other exist
Besides the interesting and applicable problem, the authors break down the problem in different levels of knowledge about the subpopulation. This allows to choose upon the task and the environment. Their experimental results cover a wide range of setups from image to language which is a plus. This shows that their method is applicable and not only abstract. Despite the minor flaws, the writing is good, and the paper is easy to follow.
**Unclear statement about the subgroups.** I could not understand whether the authors are assuming that the subpopulations are known, and discrete? And if the assignment for such subgroups are given at least over the training data. This is important to be clarified in all algorithms and theorems. This is an important flaw since for instance in Algorithm 1, and 2 the classifier c is assumed to be trained or at least trainable. **Strong assumptions in Section 3.** Although not made clear, the ass
1- The introduction effectively motivates the problem and provides a thorough overview of previous methods 2- The paper is well written
Please check the questions.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdversarial Robustness in Machine Learning · Machine Learning and Data Classification · Domain Adaptation and Few-Shot Learning
