mlsanityData to 14 Oct 2026

Same Target, Different Basins: Hard vs. Soft Labels for Annotator Distributions

arXiv 2605.20642 ↗First posted 20 May 2026cs.LGcited by 0

Not on the map. Why?

Abstract (arXiv)

When annotators disagree, that disagreement can reflect epistemic uncertainty rather than simple label noise. We study hard-label delivery as an alternative to the usual choices of collapsing votes to a single label or training directly on the empirical soft-label distribution. We focus on two primary hard-label methods: multipass, which cycles through observed votes while keeping the dataset size fixed, and stochastic label sampling (SLS), which samples one label per example at the start of each epoch. On CIFAR-10H, we find that when only a small number of annotations per example is available, hard-label delivery improves over soft-label training, with larger improvements where the sparse empirical target is farther from the full annotator distribution. When full annotator distributions are available, both hard-label methods match soft-label training. We use deterministic control as an ablation of multipass and shuffled SLS as a control that breaks the example-to-distribution match. We also show that SLS and soft-label cross-entropy optimize the same expected objective. Hard-label delivery also converges to flatter basins, with supporting descriptive evidence from OOD detection on SVHN and CIFAR-100. Overall, these results suggest that multipass is a strong practical default when raw vote counts are available, while SLS offers a lightweight alternative that remains competitive when only a few votes per example are available and matches soft-label training when full annotator distributions are available.

Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 19 of its 30 references that are in the map. First posted on arXiv 20 May 2026.

Builds on

19 of 30 references.

References · 19

  1. 2015Distilling the Knowledge in a Neural Networkcited by 10,324
  2. 2015Rethinking the Inception Architecture for Computer Visioncited by 5,475
  3. 2017mixup: Beyond Empirical Risk Minimizationcited by 5,183
  4. 2016On Large-Batch Training for Deep Learning: Generalization Gap and Sharp Minimacited by 1,352
  5. 2019When Does Label Smoothing Help?cited by 988
  6. 2020Learning from Noisy Labels with Deep Neural Networks: A Surveycited by 582
  7. 2021Dealing with Disagreements: Looking Beyond the Majority Vote in Subjective Annotationscited by 314
  8. 2019Human uncertainty makes classification more robustcited by 235
  9. 2021On the Origin of Implicit Regularization in Stochastic Gradient Descentcited by 184
  10. 2020What Can We Learn from Collective Human Opinions on Natural Language Inference Data?cited by 153
  11. 2022The 'Problem' of Human Label Variation: On Ground Truth in Data, Modeling and Evaluationcited by 139
  12. 2021Label Noise SGD Provably Prefers Flat Global Minimizerscited by 121
7 more
  1. 2017Deep learning from crowdscited by 105
  2. 2020Shape Matters: Understanding the Implicit Bias of the Noise Covariancecited by 88
  3. 2022The alignment property of SGD noise and how it helps select flat minima: A stability analysiscited by 64
  4. 2023SemEval-2023 Task 11: Learning With Disagreements (LeWiDi)cited by 52
  5. 2016DisturbLabel: Regularizing CNN on the Loss Layercited by 41
  6. 2026Beyond Consensus: Perspectivist Modeling and Evaluation of Annotator Disagreement in NLPcited by 13
  7. 2024Evaluating Posterior Probabilities: Decision Theory, Proper Scoring Rules, and Calibrationcited by 12

Built on by

Not cited yet.