This work introduces a family of generalized information measures based on the size and coverage of conformal prediction sets and formally relate conformal prediction to classical information-theoretic quantities and justifies using set-size reduction as an information gain metric.
Abstract
Conformal prediction is a popular tool for uncertainty quantification that outputs prediction sets with finite-sample coverage guarantees. While prediction set size is commonly used as a heuristic measure of uncertainty, the information-theoretic basis for this interpretation remains poorly understood. In this work, we provide such a foundation using a decision-theoretic generalization of entropy tailored to set-valued prediction. In particular, we introduce a family of generalized information measures based on the size and coverage of conformal prediction sets. Notably, Shannon mutual information admits an exact integral representation in terms of these measures. We then show that, in standard classification settings, the reduction in conformal set size from additional information (i) is sandwiched between calibration-dependent members of this family and (ii) obeys a data processing inequality, both up to finite-sample calibration and model error terms. Together, our results formally relate conformal prediction to classical information-theoretic quantities and justify using set-size reduction as an information gain metric. Empirically, we validate our theory across 11 classification settings and show that set-size reduction and Shannon mutual information can rank features differently in a greedy feature selection experiment.
For a fixed conformal score function, standard split conformal prediction calibrates a prediction set using the empirical distribution of the conformal scores, without using available side information about the data. We propose a moment-calibrated approach that uses such information to reduce variability across calibra...
Guang-Hui Wang, Liu-Hua Peng, Liu Liu et al.· 0 citations
A unified probabilistic perspective on CP and DRO is developed by viewing both as ways to turn finite calibration data into a data-dependent quantile estimator that a test score falls below with high probability.
Kehan Long, Yi-Qi Zhao, Pol Mestres et al.· 0 citations
Conformal prediction intervals are used to construct marginally well-calibrated regions around point predictions. Recent work has focused on extending these ideas to conformal predictive distributions, whose marginal probability integral transform (PIT) follows a Unif[0, 1] distribution. In this work, we investigate ho...
Dan Andrei Tudor, D. Kurowicka, Balint Negyesi et al.· 0 citations
Optimal transport (OT) enables multivariate conformal prediction (CP) to construct flexible prediction sets that reflect the underlying complex distributional geometry while retaining distribution-free coverage guarantees. Existing OT-based methods typically rely on a fixed Euclidean transport cost, which can be subopt...
Chu-Chen Zhang, Hao-Jie Ren, Zhao-Jun Wang et al.· 0 citations
The connections between conformal prediction and permutation tests are already widely-known in the literature. Some authors motivate conformal prediction by saying that it computes a permutation p-value for the hypothesis $H_0 : Y_{n+1} = y$, and then inverts this to form a prediction set for $Y_{n+1}$ (i.e., accepts a...
R. Tibshirani, R. F. Barber, Aaditya Ramdas· 0 citations
JTS-SCB forms a bounded sensitivity envelope over candidate tilts, but its calibration-only construction does not inherit the exact finite-sample weighted-conformal guarantee, so experiments show that strong plug-in predictive sampling can match the oracle when the shift is well identified, while sensitivity analysis i...
Seung-Jin Choi· 0 citations
Related blog posts
MIT News · Artificial Intelligence· news.mit.eduOct 14, 2026
Learn how Google DeepMind and GovTech Singapore uses lightweight on-device Gemma models to intercept conversational scams in private chats with zero cloud data egress.
MIT News · Artificial Intelligence· news.mit.eduOct 13, 2026
Machine-learning networks can learn without detailed instructions from a designer. Those that do may offer insight into how the brain reorganizes itself during learning.