mlsanityData to 14 Oct 2026

HyperCore: Coreset Selection under Noise via Hypersphere Models

arXiv 2509.21746 ↗First posted 26 Sep 2025cs.LG cs.AIcited by 0

Not on the map. Why?

Abstract (arXiv)

The goal of coreset selection methods is to identify representative subsets of datasets for efficient model training. Yet, existing methods often ignore the possibility of annotation errors and require fixed pruning ratios, making them impractical in real-world settings. We present HyperCore, a robust and adaptive coreset selection framework designed explicitly for noisy environments. HyperCore leverages lightweight hypersphere models learned per class, embedding in-class samples close to a hypersphere center while naturally segregating out-of-class samples based on their distance. By using Youden's J statistic, HyperCore can adaptively select pruning thresholds, enabling automatic, noise-aware data pruning without hyperparameter tuning. Our experiments reveal that HyperCore consistently surpasses state-of-the-art coreset selection methods, especially under noisy and low-data regimes. HyperCore effectively discards mislabeled and ambiguous points, yielding compact yet highly informative subsets suitable for scalable and noise-free learning.

Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 25 of its 43 references that are in the map. First posted on arXiv 26 Sep 2025.

Builds on

25 of 43 references.

References · 25

  1. 2015Deep Residual Learning for Image Recognitioncited by 52,096
  2. 2016iCaRL: Incremental Classifier and Representation Learningcited by 2,333
  3. 2018A Simple Unified Framework for Detecting Out-of-Distribution Samples and Adversarial Attackscited by 1,485
  4. 2019Decoupling Representation and Classifier for Long-Tailed Recognitioncited by 809
  5. 2018An Empirical Study of Example Forgetting during Deep Neural Network Learningcited by 678
  6. 2021Deep Learning on a Data Diet: Finding Important Examples Early in Trainingcited by 533
  7. 2022Beyond neural scaling laws: beating power law scaling via data pruningcited by 528
  8. 2018Not All Samples Are Created Equal: Deep Learning with Importance Samplingcited by 328
  9. 2021GRAD-MATCH: Gradient Matching based Data Subset Selection for Efficient Deep Model Trainingcited by 274
  10. 2020Identifying Mislabeled Data using the Area Under the Margin Rankingcited by 261
  11. 2018Dataset Distillationcited by 230
  12. 2020GLISTER: Generalization based Data Subset Selection for Efficient and Robust Learningcited by 226
13 more
  1. 2022Predictability and Surprise in Large Generative Modelscited by 210
  2. 2018Adversarial Active Learning for Deep Networks: a Margin Based Approachcited by 158
  3. 2021Active Learning by Acquiring Contrastive Examplescited by 156
  4. 2022DeepCore: A Comprehensive Library for Coreset Selection in Deep Learningcited by 147
  5. 2020Explainable Deep One-Class Classificationcited by 127
  6. 2022Coverage-centric Coreset Selection for High Pruning Ratescited by 117
  7. 2016Importance Sampling for Minibatchescited by 36
  8. 2021Accelerating Neural Architecture Search via Proxy Datacited by 14
  9. 2022Less is More: Proxy Datasets in NAS approachescited by 9
  10. 2022Adaptive Ranking-based Sample Selection for Weakly Supervised Class-imbalanced Text Classificationcited by 7
  11. 2024A Study in Dataset Pruning for Image Super-Resolutioncited by 6
  12. 2025Unifying Dataset Pruning and Distillation for Efficient Large-scale Compressioncited by 6
  13. 2023ASP: Automatic Selection of Proxy dataset for efficient AutoMLcited by 3

Built on by

Not cited yet.