mlsanityData to 7 Oct 2026

Tackling Instance-Dependent Label Noise via a Universal Probabilistic Model

arXiv 2101.05467 ↗First posted 14 Jan 2021cs.LG stat.MLcited by 12

Not on the map. Why?

Abstract (arXiv)

The drastic increase of data quantity often brings the severe decrease of data quality, such as incorrect label annotations, which poses a great challenge for robustly training Deep Neural Networks (DNNs). Existing learning mboxmethods with label noise either employ ad-hoc heuristics or restrict to specific noise assumptions. However, more general situations, such as instance-dependent label noise, have not been fully explored, as scarce studies focus on their label corruption process. By categorizing instances into confusing and unconfusing instances, this paper proposes a simple yet universal probabilistic model, which explicitly relates noisy labels to their instances. The resultant model can be realized by DNNs, where the training procedure is accomplished by employing an alternating optimization algorithm. Experiments on datasets with both synthetic and real-world label noise verify that the proposed method yields significant improvements on robustness over state-of-the-art counterparts.

Key facts. Cited by 12 papers in the map (data through 7 Oct 2026). Builds on 31 of its 48 references that are in the map. First posted on arXiv 14 Jan 2021.

Builds on

31 of 48 references.

References · 31

  1. 2015Deep Residual Learning for Image Recognitioncited by 51,809
  2. 2017Mask R-CNNcited by 7,259
  3. 2016Understanding deep learning requires rethinking generalizationcited by 1,657
  4. 2015Spatial Transformer Networkscited by 1,423
  5. 2018Co-teaching: Robust Training of Deep Neural Networks with Extremely Noisy Labelscited by 1,053
  6. 2017A Closer Look at Memorization in Deep Networkscited by 936
  7. 2018Learning to Reweight Examples for Robust Deep Learningcited by 670
  8. 2016Making Deep Neural Networks Robust to Label Noise: a Loss Correction Approachcited by 663
  9. 2017MentorNet: Learning Data-Driven Curriculum for Very Deep Neural Networks on Corrupted Labelscited by 652
  10. 2017Robust Loss Functions under Label Noise for Deep Neural Networkscited by 441
  11. 2014Training Deep Neural Networks on Noisy Labels with Bootstrappingcited by 322
  12. 2018Joint Optimization Framework for Learning with Noisy Labelscited by 293
19 more
  1. 2017WebVision Database: Visual Learning and Understanding from Web Datacited by 262
  2. 2017Positive-Unlabeled Learning with Non-Negative Risk Estimatorcited by 217
  3. 2019Probabilistic End-to-end Noise Correction for Learning with Noisy Labelscited by 210
  4. 2019Are Anchor Points Really Indispensable in Label-Noise Learning?cited by 208
  5. 2017CleanNet: Transfer Learning for Scalable Image Classifier Training with Label Noisecited by 181
  6. 2017Learning from Noisy Labels with Distillationcited by 160
  7. 2020Dual T: Reducing Estimation Error for Transition Matrix in Label-noise Learningcited by 142
  8. 2018CurriculumNet: Weakly Supervised Learning from Large-Scale Web Imagescited by 126
  9. 2015Learning with Symmetric Label Noise: The Importance of Being Unhingedcited by 120
  10. 2017Learning From Noisy Large-Scale Datasets With Minimal Supervisioncited by 115
  11. 2018Iterative Learning with Open-set Noisy Labelscited by 108
  12. 2016Deep Label Distribution Learning with Label Ambiguitycited by 104
  13. 2017Learning with Biased Complementary Labelscited by 93
  14. 2018Masking: A New Perspective of Noisy Supervisioncited by 93
  15. 2020Confidence Scores Make Instance-dependent Label-noise Learning Possiblecited by 63
  16. 2017Learning with Bounded Instance- and Label-dependent Label Noisecited by 57
  17. 2020Part-dependent Label Noise: Towards Instance-dependent Label Noisecited by 40
  18. 2020Robustness of Accuracy Metric and its Inspirations in Learning with Noisy Labelscited by 20
  19. 2016Learning from Binary Labels with Instance-Dependent Corruptioncited by 5

Built on by

Cited by year

Citing papers per year: 2021: 2; 2022: 2; 2023: 3; 2024: 3; 2025: 2.

12 papers.