Prediction Intervals and Split Conformal Prediction › Disadvantages

Michael BrenndoerferOctober 29, 20263 min read
Machine Learning from ScratchAll chapters
Part 12 of 15Calibration and Prediction Uncertainty
Chapter 77Prediction Intervals and Split Conformal Prediction › Disadvantages
Reading section 3 of 10 · Disadvantages · 3 minSection 3 of 10 · 3 min

Section 3 of 10 · 3 min read

Prediction Intervals and Split Conformal Prediction › DisadvantagesSection view · Sections in this chapter3 / 10 ↓
Reading tools Definitions, links & notes

Choose your expertise level to adjust how many terms are explained. Beginners see more tooltips, experts see fewer to maintain reading flow. Hover over underlined terms for instant definitions.

Article links

Make inline references clickable

Notes & comments

The guarantee is marginal. It averages over calibration data and a fresh test point, rather than promising the target coverage at every input or within every subgroup. Constant-width intervals can over-cover low-noise regions and under-cover high-noise regions. A particular realized calibration set and finite test batch can also have coverage below nominal. None of these observations alone contradicts the marginal theorem.

Exchangeability can fail under distribution shift and ordinary serial dependence. A future regime can differ from the calibration period, and a sequence whose dependence changes with temporal lag is generally not invariant to arbitrary permutations. Dependence alone is not enough to rule out exchangeability: dependent exchangeable samples exist. A chronological split or rolling recalibration does not by itself restore the ordinary split-conformal guarantee.

Holding out calibration data leaves fewer observations for fitting. When data are scarce, related methods such as jackknife+ and CV+ reuse observations through additional model fits. Their constructions and finite-sample bounds differ from ordinary split conformal. Jackknife+ is the leave-one-out special case of CV+, obtained when each fold contains one observation. These methods should not be treated as interchangeable ways to preserve the split-conformal guarantee. This chapter keeps the separate fitting and calibration roles visible.

Conformal calibration does not improve the predictor itself. Large calibration errors can require a wide margin, and a constant margin can still leave a difficult subgroup under-covered. A finite calibration sample does not force the realized test fraction to meet nominal. Width is useful alongside coverage, but model choice, score choice and sampling variation all affect it.

Discrete scores and ties can make deterministic sets conservative. Classification sets can contain several labels or be empty. For the probability-threshold score, an empty set means that no class probability reaches the calibrated threshold. It does not by itself establish that the input is out of distribution. A downstream rule can add a label to an empty set, which only enlarges the set and therefore cannot reduce inclusion coverage.

Exchangeability, marginal coverage, and failure modes

Exchangeability is the assumption that the joint distribution of the n+1n+1 points (the nn calibration points plus the test point) is invariant to permutation of their indices. In symbols, for any permutation π\pi of {1,…,n+1}\{1,\dots,n+1\}, the joint distribution of (Z1,…,Zn+1)(Z_1,\dots,Z_{n+1}) equals that of (Zπ(1),…,Zπ(n+1))(Z_{\pi(1)},\dots,Z_{\pi(n+1)}), where Zi=(Xi,Yi)Z_i = (X_i, Y_i). Independent and identically distributed data are exchangeable. Exchangeable data need not be independent: a uniformly ordered sample without replacement from a fixed population is exchangeable but dependent. A calibration/test distinction that systematically changes the joint distribution lacks this permutation symmetry.

Write C^(x)\hat C(x) for the prediction set returned at input xx. Let α∈(0,1)\alpha\in(0,1) be the target miscoverage level, so 1−α1-\alpha is the target inclusion probability.

Marginal coverage is P(Yn+1∈C^(Xn+1))≥1−αP(Y_{n+1}\in\hat C(X_{n+1}))\ge1-\alpha, with probability over calibration and test draws. Conditional coverage would require P(Yn+1∈C^(Xn+1)∣Xn+1=x)≥1−αP(Y_{n+1}\in\hat C(X_{n+1})\mid X_{n+1}=x)\ge1-\alpha at every relevant xx. For regression over unrestricted distributions with continuously varying covariates, exact distribution-free conditional coverage has strong impossibility results: nontrivial finite-length intervals cannot be guaranteed uniformly without additional restrictions (Vovk, 2012; Barber, Candès, Ramdas and Tibshirani, 2021). Group-conditional guarantees and assumptions about the conditional distribution are different, more restricted targets.

These distinctions give practical failure checks. Compare calibration and deployment populations; check whether temporal or clustered structure defeats exchangeability; and keep model fitting, preprocessing and selection outside the calibration and test outcomes. Training residuals can be optimistic because fitting used their responses. Reusing calibration outcomes for model selection can also destroy the held-out symmetry argument. Either practice removes the ordinary proof; it does not imply an identical numerical shortfall in every dataset.

Comments

Add to the conversation

A question, a correction, or an example from your own work.

No comments yet. Be the first to share your thoughts!

Newsletter

Stay up to date

Get new articles, book updates, and notes on AI and technology.

Unsubscribe at any time. Privacy policy