## A Tutorial on Conformal Prediction

** Glenn Shafer, Vladimir Vovk**; 9(Mar):371--421, 2008.

### Abstract

Conformal prediction uses past experience to determine precise levels
of confidence in new predictions. Given an error probability
ε, together with a method that makes a prediction *ŷ*
of a label *y*, it produces a set of labels, typically containing
*ŷ*, that also contains *y* with probability 1 – ε.
Conformal prediction can be applied to any method for producing
*ŷ*: a nearest-neighbor method, a support-vector machine, ridge
regression, etc.

Conformal prediction is designed for an on-line setting in which labels are predicted successively, each one being revealed before the next is predicted. The most novel and valuable feature of conformal prediction is that if the successive examples are sampled independently from the same distribution, then the successive predictions will be right 1 – ε of the time, even though they are based on an accumulating data set rather than on independent data sets.

In addition to the model under which successive examples are sampled independently, other on-line compression models can also use conformal prediction. The widely used Gaussian linear model is one of these.

This tutorial presents a self-contained account of the theory of
conformal prediction and works through several numerical examples. A
more comprehensive treatment of the topic is provided in
*Algorithmic Learning in a Random World*, by Vladimir Vovk,
Alex Gammerman, and Glenn Shafer (Springer, 2005).

[abs][pdf]