REVIEW 4 cited by
Machine Learning with a Reject Option: A survey
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
read the original abstract
Machine learning models always make a prediction, even when it is likely to be inaccurate. This behavior should be avoided in many decision support applications, where mistakes can have severe consequences. Albeit already studied in 1970, machine learning with rejection recently gained interest. This machine learning subfield enables machine learning models to abstain from making a prediction when likely to make a mistake. This survey aims to provide an overview on machine learning with rejection. We introduce the conditions leading to two types of rejection, ambiguity and novelty rejection, which we carefully formalize. Moreover, we review and categorize strategies to evaluate a model's predictive and rejective quality. Additionally, we define the existing architectures for models with rejection and describe the standard techniques for learning such models. Finally, we provide examples of relevant application domains and show how machine learning with rejection relates to other machine learning research areas.
Forward citations
Cited by 4 Pith papers
-
Removable Defects: The Economics and Limits of Deliberate Deficiency
A deliberately narrow specialist can profitably keep a defect only when the detector that triggers compensation sits outside the defect; inside, the miss rate equals the capture rate.
-
Polyra Swarms: A Shape-Based Approach to Machine Learning
Polyra Swarms approximate data distributions as logical combinations of polytopes, achieving competitive anomaly detection and enabling symbolic abstraction to simple rules.
-
Conservative classifiers do consistently well with improving agents: characterizing statistical and online learning
The paper gives an exact characterization of which concept classes are properly PAC-learnable with improving agents, plus new positive results for improper learning under coverable distributions, learning with bounded...
-
Clustered Calibration: Representation-Aware Probability Calibration via Learned Subpopulations
Clustered Calibration groups samples by learned representations and calibrates each cluster separately, with a new cluster-binned ECE claimed to rank models by both calibration and AUC.
Discussion (0). Continue with ORCID to comment.