mlsanityData to 14 Oct 2026

Learning to Abstain From Uninformative Data

arXiv 2309.14240 ↗First posted 25 Sep 2023cs.LGcited by 2

Not on the map. Why?

Abstract (arXiv)

Learning and decision-making in domains with naturally high noise-to-signal ratio, such as Finance or Healthcare, is often challenging, while the stakes are very high. In this paper, we study the problem of learning and acting under a general noisy generative process. In this problem, the data distribution has a significant proportion of uninformative samples with high noise in the label, while part of the data contains useful information represented by low label noise. This dichotomy is present during both training and inference, which requires the proper handling of uninformative data during both training and testing. We propose a novel approach to learning under these conditions via a loss inspired by the selective learning theory. By minimizing this loss, the model is guaranteed to make a near-optimal decision by distinguishing informative data from uninformative data and making predictions. We build upon the strength of our theoretical guarantees by describing an iterative algorithm, which jointly optimizes both a predictor and a selector, and evaluates its empirical performance in a variety of settings.

Key facts. Cited by 2 papers in the map (data through 14 Oct 2026). Builds on 33 of its 89 references that are in the map. First posted on arXiv 25 Sep 2023.

Builds on

33 of 89 references.

References · 33

  1. 2017Attention Is All You Needcited by 60,361
  2. 2015Deep Residual Learning for Image Recognitioncited by 52,096
  3. 2018BERT: Pre-training of Deep Bidirectional Transformers for Language Understandingcited by 40,399
  4. 2019PyTorch: An Imperative Style, High-Performance Deep Learning Librarycited by 20,305
  5. 2016Densely Connected Convolutional Networkscited by 6,720
  6. 2015Dropout as a Bayesian Approximation: Representing Model Uncertainty in Deep Learningcited by 4,448
  7. 2017What Uncertainties Do We Need in Bayesian Deep Learning for Computer Vision?cited by 2,352
  8. 2020FixMatch: Simplifying Semi-Supervised Learning with Consistency and Confidencecited by 2,085
  9. 2019Invariant Risk Minimizationcited by 1,854
  10. 2016Understanding deep learning requires rethinking generalizationcited by 1,674
  11. 2017Selective Classification for Deep Neural Networkscited by 852
  12. 2019SelectiveNet: A Deep Neural Network with an Integrated Reject Optioncited by 350
21 more
  1. 2020Consistent Estimators for Learning to Defer to an Expertcited by 271
  2. 2017Predict Responsibly: Improving Fairness and Accuracy by Learning to Defercited by 233
  3. 2018To Trust Or Not To Trust A Classifiercited by 207
  4. 2020CoMatch: Semi-supervised Learning with Contrastive Graph Regularizationcited by 167
  5. 2016Variance-based regularization with convex objectivescited by 155
  6. 2020Self-Adaptive Training: beyond Empirical Risk Minimizationcited by 126
  7. 2018Uncertainty in Neural Networks: Approximately Bayesian Ensemblingcited by 94
  8. 2019Combating Label Noise in Deep Learning Using Abstentioncited by 86
  9. 2019Deep Gamblers: Learning to Abstain with Portfolio Theorycited by 71
  10. 2014Minimax Analysis of Active Learningcited by 61
  11. 2019Distribution-Independent PAC Learning of Halfspaces with Massart Noisecited by 54
  12. 2015Fast rates in statistical and online learningcited by 47
  13. 2020Learning Halfspaces with Massart Noise Under Structured Distributionscited by 45
  14. 2019On the Calibration of Multiclass Classification with Rejectioncited by 41
  15. 2020Selective Classification via One-Sided Predictioncited by 38
  16. 2015Efficient Learning of Linear Separators under Bounded Noisecited by 36
  17. 2021Improved Algorithms for Efficient Active Learning Halfspaces with Massart and Tsybakov noisecited by 18
  18. 2017Adaptive Classification for Prediction Under a Budgetcited by 15
  19. 2017On Reject and Refine Options in Multicategory Classificationcited by 9
  20. 2021Online Selective Classification with Limited Feedbackcited by 9
  21. 2020Budget Learning via Bracketingcited by 6

Built on by

Cited by year

Citing papers per year: 2025: 2.

2 papers.