Classification with Reject Option: Distribution-free Error Guarantees via Conformal Prediction
Johan Hallberg Szabadv\'ary, Tuwe L\"ofstr\"om, Ulf Johansson, Cecilia S\"onstr\"od, Ernst Ahlberg, Lars Carlsson

TL;DR
This paper formalizes the use of conformal prediction for binary classification with reject options, providing distribution-free error guarantees and practical methods to balance error and reject rates.
Contribution
It introduces a formal framework connecting conformal prediction with reject options, deriving theoretical error guarantees and practical error-reject trade-off tools.
Findings
Distribution-free error guarantees for reject options
Finite sample estimates for error rates
Error-reject trade-off curves
Abstract
Machine learning (ML) models always make a prediction, even when they are likely to be wrong. This causes problems in practical applications, as we do not know if we should trust a prediction. ML with reject option addresses this issue by abstaining from making a prediction if it is likely to be incorrect. In this work, we formalise the approach to ML with reject option in binary classification, deriving theoretical guarantees on the resulting error rate. This is achieved through conformal prediction (CP), which produce prediction sets with distribution-free validity guarantees. In binary classification, CP can output prediction sets containing exactly one, two or no labels. By accepting only the singleton predictions, we turn CP into a binary classifier with reject option. Here, CP is formally put in the framework of predicting with reject option. We state and prove the resulting…
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.
