mlsanityData to 7 Oct 2026

Identify ambiguous tasks combining crowdsourced labels by weighting Areas Under the Margin

arXiv 2209.15380 ↗First posted 30 Sep 2022cs.LG cs.HC stat.MLcited by 1

Not on the map. Why?

Abstract (arXiv)

In supervised learning - for instance in image classification - modern massive datasets are commonly labeled by a crowd of workers. The obtained labels in this crowdsourcing setting are then aggregated for training, generally leveraging a per-worker trust score. Yet, such workers oriented approaches discard the tasks' ambiguity. Ambiguous tasks might fool expert workers, which is often harmful for the learning step. In standard supervised learning settings - with one label per task - the Area Under the Margin (AUM) was tailored to identify mislabeled data. We adapt the AUM to identify ambiguous tasks in crowdsourced learning scenarios, introducing the Weighted Areas Under the Margin (WAUM). The WAUM is an average of AUMs weighted according to task-dependent scores. We show that the WAUM can help discarding ambiguous tasks from the training set, leading to better generalization performance. We report improvements over existing strategies for learning with a crowd, both on simulated settings, and on real datasets such as CIFAR-10H (a crowdsourced dataset with a high number of answered labels),LabelMe and Music (two datasets with few answered votes).

Key facts. Cited by 1 paper in the map (data through 7 Oct 2026). Builds on 38 of its 71 references that are in the map. First posted on arXiv 30 Sep 2022.

Builds on

38 of 71 references.

References · 38

  1. 2015Deep Residual Learning for Image Recognitioncited by 51,809
  2. 2019PyTorch: An Imperative Style, High-Performance Deep Learning Librarycited by 20,160
  3. 2017mixup: Beyond Empirical Risk Minimizationcited by 5,155
  4. 2017On Calibration of Modern Neural Networkscited by 4,860
  5. 2019When Does Label Smoothing Help?cited by 985
  6. 2021Deep Learning on a Data Diet: Finding Important Examples Early in Trainingcited by 529
  7. 2022Beyond neural scaling laws: beating power law scaling via data pruningcited by 519
  8. 2019Confident Learning: Estimating Uncertainty in Dataset Labelscited by 411
  9. 2021Pervasive Label Errors in Test Sets Destabilize Machine Learning Benchmarkscited by 388
  10. 2019Verified Uncertainty Calibrationcited by 307
  11. 2020Identifying Mislabeled Data using the Area Under the Margin Rankingcited by 259
  12. 2019Human uncertainty makes classification more robustcited by 231
26 more
  1. 2021Improving Calibration for Long-Tailed Recognitioncited by 212
  2. 2022Datamodels: Predicting Predictions from Training Datacited by 186
  3. 2019Deep Self-Learning From Noisy Labelscited by 122
  4. 2017Deep learning from crowdscited by 105
  5. 2017Who Said What: Modeling Individual Labelers Improves Classificationcited by 77
  6. 2020A statistical theory of cold posteriors in deep neural networkscited by 53
  7. 2015Risk Bounds for the Majority Vote: From a PAC-Bayesian Analysis to a Learning Algorithmcited by 50
  8. 2017The Relative Performance of Ensemble Methods with Deep Convolutional Neural Networks for Image Classificationcited by 50
  9. 2020Combining Ensembles and Data Augmentation can Harm your Calibrationcited by 44
  10. 2021Accelerating Deep Learning with Dynamic Data Pruningcited by 43
  11. 2015Loss Functions for Top-k Error: Analysis and Insightscited by 38
  12. 2019On the Consistency of Top-k Surrogate Lossescited by 35
  13. 2020Learning from Crowds by Modeling Common Confusionscited by 32
  14. 2022On the Calibration of Pre-trained Language Models using Mixup Guided by Area Under the Margin and Saliencycited by 31
  15. 2019Identifying Mislabeled Instances in Classification Datasetscited by 26
  16. 2019Crowdsourcing via Pairwise Co-occurrences: Identifiability and Algorithmscited by 23
  17. 2020Adversarial Crowdsourcing Through Robust Rank-One Matrix Completioncited by 21
  18. 2018Fast Dawid-Skene: A Fast Vote Aggregation Scheme for Sentiment Classificationcited by 12
  19. 2019Gradient Descent for Sparse Rank-One Matrix Completion for Crowd-Sourced Aggregation of Sparsely Interacting Workerscited by 11
  20. 2021Tournesol: A quest for a large, secure and trustworthy database of reliable human judgmentscited by 11
  21. 2022Stochastic smoothing of the top-K calibrated hinge loss for deep imbalanced classificationcited by 10
  22. 2013Minimax Optimal Convergence Rates for Estimating Ground Truth from Crowdsourced Labelscited by 7
  23. 2018Convolutional Neural Network Achieves Human-level Accuracy in Music Genre Classificationcited by 7
  24. 2015Regularized Minimax Conditional Entropy for Crowdsourcingcited by 6
  25. 2018Analysis of Minimax Error Rate for Crowdsourcing and Its Application to Worker Clustering Modelcited by 6
  26. 2017Does Confidence Reporting from the Crowd Benefit Crowdsourcing Performance?cited by 1

Built on by

Cited by year

Citing papers per year: 2024: 1.

1 paper.