Partial-Label Learning with a Reject Option
Not on the map. Why?
Abstract (arXiv)
In real-world applications, one often encounters ambiguously labeled data, where different annotators assign conflicting class labels. Partial-label learning allows training classifiers in this weakly supervised setting, where state-of-the-art methods already show good predictive performance. However, even the best algorithms give incorrect predictions, which can have severe consequences when they impact actions or decisions. We propose a novel risk-consistent nearest-neighbor-based partial-label learning algorithm with a reject option, that is, the algorithm can reject unsure predictions. Extensive experiments on artificial and real-world datasets show that our method provides the best trade-off between the number and accuracy of non-rejected predictions when compared to our competitors, which use confidence thresholds for rejecting unsure predictions. When evaluated without the reject option, our nearest-neighbor-based approach also achieves competitive prediction performance.
Key facts. Cited by 3 papers in the map (data through 13 Oct 2026). Builds on 30 of its 97 references that are in the map. First posted on arXiv 1 Feb 2024.
Builds on
30 of 97 references.
References · 30
- 2017On Calibration of Modern Neural Networkscited by 4,902
- 2017Fashion-MNIST: a Novel Image Dataset for Benchmarking Machine Learning Algorithmscited by 4,328
- 2013Auto-Encoding Variational Bayescited by 4,024
- 2016Simple and Scalable Predictive Uncertainty Estimation using Deep Ensemblescited by 3,902
- 2017What Uncertainties Do We Need in Bayesian Deep Learning for Computer Vision?cited by 2,340
- 2019Aleatoric and Epistemic Uncertainty in Machine Learning: An Introduction to Concepts and Methodscited by 910
- 2018Evidential Deep Learning to Quantify Classification Uncertaintycited by 729
- 2018Deep Learning for Classical Japanese Literaturecited by 418
- 2022Quantifying Aleatoric and Epistemic Uncertainty in Machine Learning: Are Conditional Entropy and Mutual Information Appropriate Measures?cited by 125
- 2020Progressive Identification of True Labels for Partial-Label Learningcited by 102
- 2021Learning with Feature-Dependent Label Noise: A Progressive Approachcited by 102
- 2020Provably Consistent Partial-Label Learningcited by 92
18 more
- 2023Who Should Predict? Exact Algorithms For Learning to Defer to Humanscited by 70
- 2019Uncertainty Quantification with Statistical Guarantees in End-to-End Autonomous Driving Controlcited by 60
- 2018Complementary-Label Learning for Arbitrary Losses and Modelscited by 57
- 2020Classification with Rejection Based on Cost-sensitive Classificationcited by 55
- 2016On the Safety of Machine Learning: Cyber-Physical Systems, Decision Sciences, and Data Productscited by 52
- 2021Instance-Dependent Partial Label Learningcited by 49
- 2019Partial Label Learning with Self-Guided Retrainingcited by 47
- 2019On the Calibration of Multiclass Classification with Rejectioncited by 41
- 2023Is the Volume of a Credal Set a Good Measure for Epistemic Uncertainty?cited by 40
- 2023Predictor-Rejector Multi-Class Abstention: Theoretical Analysis and Algorithmscited by 36
- 2020Structured Prediction with Partial Labelling through the Infimum Losscited by 34
- 2020Regression with reject option and application to kNNcited by 30
- 2022Progressive Purification for Instance-Dependent Partial Label Learningcited by 23
- 2021An evidential classifier based on Dempster-Shafer theory and deep learningcited by 18
- 2023Two Sides of Miscalibration: Identifying Over and Under-Confidence Prediction for Network Calibrationcited by 14
- 2018Decision-Making with Belief Functions: a Reviewcited by 13
- 2023CroSel: Cross Selection of Confident Pseudo Labels for Partial-Label Learningcited by 11
- 2023Regression with Cost-based Rejectioncited by 11
Built on by
Citing papers per year: 2025: 3.
3 papers.