mlsanityData to 7 Oct 2026

Hypothesis Testing for Class-Conditional Label Noise

arXiv 2103.02630 ↗First posted 3 Mar 2021cs.LGcited by 0

Not on the map. Why?

Abstract (arXiv)

In this paper we provide machine learning practitioners with tools to answer the question: is there class-conditional noise in my labels? In particular, we present hypothesis tests to check whether a given dataset of instance-label pairs has been corrupted with class-conditional label noise, as opposed to uniform label noise, with the former biasing learning, while the latter -- under mild conditions -- does not. The outcome of these tests can then be used in conjunction with other information to assess further steps. While previous works explore the direct estimation of the noise rates, this is known to be hard in practice and does not offer a real understanding of how trustworthy the estimates are. These methods typically require anchor points -- examples whose true posterior is either 0 or 1. Differently, in this paper we assume we have access to a set of anchor points whose true posterior is approximately 1/2. The proposed hypothesis tests are built upon the asymptotic properties of Maximum Likelihood Estimators for Logistic Regression models. We establish the main properties of the tests, including a theoretical and empirical analysis of the dependence of the power on the test on the training sample size, the number of anchor points, the difference of the noise rates and the use of relaxed anchors.

Key facts. No citing papers in the map yet (data through 7 Oct 2026). Builds on 13 of its 40 references that are in the map. First posted on arXiv 3 Mar 2021.

Builds on

13 of 40 references.

References · 13

  1. 2018Datasheets for Datasetscited by 1,371
  2. 2016Making Deep Neural Networks Robust to Label Noise: a Loss Correction Approachcited by 663
  3. 2019Confident Learning: Estimating Uncertainty in Dataset Labelscited by 411
  4. 2019Are Anchor Points Really Indispensable in Label-Noise Learning?cited by 208
  5. 2013Classification with Asymmetric Label Noise: Consistency and Maximal Denoisingcited by 67
  6. 2017Learning with Bounded Instance- and Label-dependent Label Noisecited by 57
  7. 2014Making Risk Minimization Tolerant to Label Noisecited by 54
  8. 2017Learning with Confident Examples: Rank Pruning for Robust Classification with Noisy Labelscited by 52
  9. 2017Learning Deep Networks from Noisy Labels with Dropout Regularizationcited by 32
  10. 2020Learning from Crowds by Modeling Common Confusionscited by 32
  11. 2020Data Readiness Reportcited by 17
  12. 2017Data Readiness Levelscited by 12
1 more
  1. 2019FAT Forensics: A Python Toolbox for Algorithmic Fairness, Accountability and Transparencycited by 11

Built on by

Not cited yet.