Discretized conformal prediction for efficient distribution-free inference
Wenyu Chen, Kelli-Jean Chun, Rina Foygel Barber

TL;DR
This paper introduces discretized conformal prediction algorithms that provide reliable prediction intervals with reduced computational cost, balancing accuracy and efficiency in distribution-free regression inference.
Contribution
It proposes a novel discretized approach to conformal prediction that guarantees coverage and improves computational efficiency compared to traditional methods.
Findings
Guarantees coverage probability with discretized methods
Reduces computational cost in conformal prediction
Balances accuracy and efficiency in distribution-free inference
Abstract
In regression problems where there is no known true underlying model, conformal prediction methods enable prediction intervals to be constructed without any assumptions on the distribution of the underlying data, except that the training and test data are assumed to be exchangeable. However, these methods bear a heavy computational cost-and, to be carried out exactly, the regression algorithm would need to be fitted infinitely many times. In practice, the conformal prediction method is run by simply considering only a finite grid of finely spaced values for the response variable. This paper develops discretized conformal prediction algorithms that are guaranteed to cover the target value with the desired probability, and that offer a tradeoff between computational cost and prediction accuracy.
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
TopicsMachine Learning and Algorithms · Fault Detection and Control Systems · Gaussian Processes and Bayesian Inference
