How many labelers do you have? A closer look at gold-standard labels
Not on the map. Why?
Abstract (arXiv)
The construction of most supervised learning datasets revolves around collecting multiple labels for each instance, then aggregating the labels to form a type of "true" label. We question the wisdom of this pipeline by developing a (stylized) theoretical model of this process and analyzing its statistical consequences, showing how access to non-aggregated label information can make training well-calibrated models more feasible than it is with cleaned labels. The entire story, however, is subtle, and the contrasts between aggregated and fuller label information depend on the particulars of the problem, where estimators that use aggregated information exhibit robust but slower rates of convergence, while estimators that can effectively leverage all labels converge more quickly if they have fidelity to (or can learn) the true labeling process. The theory makes several predictions for real-world datasets, including when non-aggregate labels should improve learning performance, which we test to corroborate the validity of our predictions.
Key facts. Cited by 8 papers in the map (data through 14 Oct 2026). Builds on 8 of its 38 references that are in the map. First posted on arXiv 24 Jun 2022.
Builds on
8 of 38 references.
References · 8
- 2014ImageNet Large Scale Visual Recognition Challengecited by 8,498
- 2017The Implicit Bias of Gradient Descent on Separable Datacited by 655
- 2017Snorkel: Rapid Training Data Creation with Weak Supervisioncited by 372
- 2019Human uncertainty makes classification more robustcited by 235
- 2014Qualitatively characterizing neural network optimization problemscited by 188
- 2016Learning from Untrusted Datacited by 90
- 2018A modern maximum-likelihood theory for high-dimensional logistic regressioncited by 81
- 2018The phase transition for the existence of the maximum likelihood estimate in high-dimensional logistic regressioncited by 46
Built on by
Citing papers per year: 2024: 3; 2025: 2; 2026: 3.
8 papers.
- 2024Active Statistical Inferencecited by 50
- 2025Probably Approximately Correct Labelscited by 8
- 2026A Bitter Lesson for Data Filteringcited by 8
- 2024Don't Label Twice: Quantity Beats Quality when Comparing Binary Classifiers on a Budgetcited by 7
- 2024Adaptive Crowdsourcing Via Self-Supervised Learningcited by 0
- 2025Some Robustness Properties of Label Cleaningcited by 0
- 2026Three Models of RLHF Annotation: Extension, Evidence, and Authoritycited by 0
- 2026Set-Valued Policy Learningcited by 0
- 2026Set-Valued Policy Learning19 May 2026
- 2026A Bitter Lesson for Data Filtering19 May 2026
- 2026Three Models of RLHF Annotation: Extension, Evidence, and Authority28 Apr 2026
- 2025Some Robustness Properties of Label Cleaning14 Sep 2025
- 2025Probably Approximately Correct Labels12 Jun 2025
- 2024Active Statistical Inference5 Mar 2024
- 2024Don't Label Twice: Quantity Beats Quality when Comparing Binary Classifiers on a Budget3 Feb 2024
- 2024Adaptive Crowdsourcing Via Self-Supervised Learning24 Jan 2024