2018
DOI: 10.1214/17-ejs1388
|View full text |Cite
|
Sign up to set email alerts
|

Consistent algorithms for multiclass classification with an abstain option

Abstract: We consider the problem of n-class classification (n ≥ 2), where the classifier can choose to abstain from making predictions at a given cost, say, a factor α of the cost of misclassification. Designing consistent algorithms for such n-class classification problems with a 'reject option' is the main goal of this paper, thereby extending and generalizing previously known results for n = 2. We show that the Crammer-Singer surrogate and the one vs all hinge loss, albeit with a different predictor than the standar… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

0
36
0

Year Published

2018
2018
2024
2024

Publication Types

Select...
5
2

Relationship

0
7

Authors

Journals

citations
Cited by 31 publications
(36 citation statements)
references
References 15 publications
0
36
0
Order By: Relevance
“…Classifiers that output possibly more than one label are known as set-valued classifiers (Grycko, 1993) or non-deterministic classifiers (del Coz et al, 2009). In another related framework called classification with reject option (Chow, 1970;Herbei and Wegkamp, 2006;Bartlett and Wegkamp, 2008;Yuan and Wegkamp, 2010;Ramaswamy et al, 2015), a classifier may reject to output a definitive class label if the uncertainty is high. Set-valued classification contains this framework as a special case, as one can view the "reject to classify" option as outputting the entire set of possible labels.…”
Section: Related Workmentioning
confidence: 99%
“…Classifiers that output possibly more than one label are known as set-valued classifiers (Grycko, 1993) or non-deterministic classifiers (del Coz et al, 2009). In another related framework called classification with reject option (Chow, 1970;Herbei and Wegkamp, 2006;Bartlett and Wegkamp, 2008;Yuan and Wegkamp, 2010;Ramaswamy et al, 2015), a classifier may reject to output a definitive class label if the uncertainty is high. Set-valued classification contains this framework as a special case, as one can view the "reject to classify" option as outputting the entire set of possible labels.…”
Section: Related Workmentioning
confidence: 99%
“…There is a rapidly increasing line of work devoted to designing classifiers that are able to defer decisions (Bartlett and Wegkamp 2008;Cortes, DeSalvo, and Mohri 2016;Geifman, Uziel, and El-Yaniv 2018;Geifman and El-Yaniv 2019;Raghu et al 2019b;Ramaswamy et al 2018;Thulasidasan et al 2019;Liu et al 2019). Here, the classifiers learn to defer either by considering the defer action as an additional label value or by training an independent classifier to decide about deferred decisions.…”
Section: Introductionmentioning
confidence: 99%
“…One type of procedure allows a rejection option, that is, if a future object falls into a 'rejection' region, then no classification is made for the object. Such a procedure aims to construct a suitable rejection region to minimize a pre-specified risk; see, e.g., [5][6][7][8][9] and the references therein. Non-deterministic classifiers are proposed in [10], which allow a future object to be classified possibly into several classes.…”
Section: Introductionmentioning
confidence: 99%