mlsanityData to 14 Oct 2026

Noisy Ostracods: A Fine-Grained, Imbalanced Real-World Dataset for Benchmarking Robust Machine Learning and Label Correction Methods

arXiv 2412.02313 ↗First posted 3 Dec 2024cs.LG cs.CVcited by 1

Not on the map. Why?

Abstract (arXiv)

We present the Noisy Ostracods, a noisy dataset for genus and species classification of crustacean ostracods with specialists' annotations. Over the 71466 specimens collected, 5.58% of them are estimated to be noisy (possibly problematic) at genus level. The dataset is created to addressing a real-world challenge: creating a clean fine-grained taxonomy dataset. The Noisy Ostracods dataset has diverse noises from multiple sources. Firstly, the noise is open-set, including new classes discovered during curation that were not part of the original annotation. The dataset has pseudo-classes, where annotators misclassified samples that should belong to an existing class into a new pseudo-class. The Noisy Ostracods dataset is highly imbalanced with a imbalance factor ρ = 22429. This presents a unique challenge for robust machine learning methods, as existing approaches have not been extensively evaluated on fine-grained classification tasks with such diverse real-world noise. Initial experiments using current robust learning techniques have not yielded significant performance improvements on the Noisy Ostracods dataset compared to cross-entropy training on the raw, noisy data. On the other hand, noise detection methods have underperformed in error hit rate compared to naive cross-validation ensembling for identifying problematic labels. These findings suggest that the fine-grained, imbalanced nature, and complex noise characteristics of the dataset present considerable challenges for existing noise-robust algorithms. By openly releasing the Noisy Ostracods dataset, our goal is to encourage further research into the development of noise-resilient machine learning methods capable of effectively handling diverse, real-world noise in fine-grained classification tasks. The dataset, along with its evaluation protocols, can be accessed at https://github.com/H-Jamieu/Noisyostracods.

Key facts. Cited by 1 paper in the map (data through 14 Oct 2026). Builds on 44 of its 67 references that are in the map. First posted on arXiv 3 Dec 2024.

Builds on

44 of 67 references.

References · 44

  1. 2015Deep Residual Learning for Image Recognitioncited by 52,096
  2. 2021Learning Transferable Visual Models From Natural Language Supervisioncited by 33,744
  3. 2020An Image is Worth 16x16 Words: Transformers for Image Recognition at Scalecited by 30,186
  4. 2014ImageNet Large Scale Visual Recognition Challengecited by 8,498
  5. 2021Masked Autoencoders Are Scalable Vision Learnerscited by 7,403
  6. 2014Explaining and Harnessing Adversarial Examplescited by 7,364
  7. 2017mixup: Beyond Empirical Risk Minimizationcited by 5,183
  8. 2022A ConvNet for the 2020scited by 3,579
  9. 2019CutMix: Regularization Strategy to Train Strong Classifiers with Localizable Featurescited by 2,884
  10. 2016Aggregated Residual Transformations for Deep Neural Networkscited by 2,546
  11. 2019Searching for MobileNetV3cited by 1,994
  12. 2020Sharpness-Aware Minimization for Efficiently Improving Generalizationcited by 1,417
32 more
  1. 2021Swin Transformer V2: Scaling Up Capacity and Resolutioncited by 1,228
  2. 2018ShuffleNet V2: Practical Guidelines for Efficient CNN Architecture Designcited by 1,136
  3. 2021EfficientNetV2: Smaller Models and Faster Trainingcited by 1,135
  4. 2018Co-teaching: Robust Training of Deep Neural Networks with Extremely Noisy Labelscited by 1,059
  5. 2020Designing Network Design Spacescited by 960
  6. 2018MnasNet: Platform-Aware Neural Architecture Search for Mobilecited by 943
  7. 2020DivideMix: Learning with Noisy Labels as Semi-supervised Learningcited by 692
  8. 2017MentorNet: Learning Data-Driven Curriculum for Very Deep Neural Networks on Corrupted Labelscited by 653
  9. 2020Learning from Noisy Labels with Deep Neural Networks: A Surveycited by 582
  10. 2022MaxViT: Multi-Axis Vision Transformercited by 476
  11. 2019Confident Learning: Estimating Uncertainty in Dataset Labelscited by 413
  12. 2019How does Disagreement Help Generalization against Label Corruption?cited by 390
  13. 2019Using Pre-Training Can Improve Model Robustness and Uncertaintycited by 373
  14. 2017Don't Decay the Learning Rate, Increase the Batch Sizecited by 320
  15. 2020Identifying Mislabeled Data using the Area Under the Margin Rankingcited by 261
  16. 2021Learning with Noisy Labels Revisited: A Study Using Real-World Human Annotationscited by 256
  17. 2019Human uncertainty makes classification more robustcited by 235
  18. 2019Understanding and Utilizing Deep Neural Networks Trained with Noisy Labelscited by 209
  19. 2020A Survey of Label-noise Representation Learning: Past, Present and Futurecited by 122
  20. 2021Sample Selection with Uncertainty of Losses for Learning with Noisy Labelscited by 79
  21. 2021Clusterability as an Alternative to Anchor Points When Learning with Noisy Labelscited by 65
  22. 2021Detecting Corrupted Labels Without Training a Model to Predictcited by 58
  23. 2021Interactive Label Cleaning with Example-based Explanationscited by 49
  24. 2023A Step Towards Worldwide Biodiversity Assessment: The BIOSCAN-1M Insect Datasetcited by 30
  25. 2023Unmasking and Improving Data Credibility: A Study with Datasets for Training Harmless Language Modelscited by 26
  26. 2022Class-Difficulty Based Methods for Long-Tailed Visual Recognitioncited by 23
  27. 2024Why is SAM Robust to Label Noise?cited by 21
  28. 2023AQuA: A Benchmarking Tool for Label Quality Assessmentcited by 16
  29. 2023When does Privileged Information Explain Away Label Noise?cited by 10
  30. 2024Estimating Noisy Class Posterior with Part-level Labels for Noisy Label Learningcited by 7
  31. 2022Dynamic Loss For Robust Learningcited by 6
  32. 2023An Empirical Study of Automated Mislabel Detection in Real World Vision Datasetscited by 3

Built on by

Cited by year

Citing papers per year: 2025: 1.

1 paper.