mlsanityData to 7 Oct 2026

Investigating the Impact of Hard Samples on Accuracy Reveals In-class Data Imbalance

arXiv 2409.14401 ↗First posted 22 Sep 2024cs.LGcited by 1

Not on the map. Why?

Abstract (arXiv)

In the AutoML domain, test accuracy is heralded as the quintessential metric for evaluating model efficacy, underpinning a wide array of applications from neural architecture search to hyperparameter optimization. However, the reliability of test accuracy as the primary performance metric has been called into question, notably through research highlighting how label noise can obscure the true ranking of state-of-the-art models. We venture beyond, along another perspective where the existence of hard samples within datasets casts further doubt on the generalization capabilities inferred from test accuracy alone. Our investigation reveals that the distribution of hard samples between training and test sets affects the difficulty levels of those sets, thereby influencing the perceived generalization capability of models. We unveil two distinct generalization pathways-toward easy and hard samples-highlighting the complexity of achieving balanced model evaluation. Finally, we propose a benchmarking procedure for comparing hard sample identification methods, facilitating the advancement of more nuanced approaches in this area. Our primary goal is not to propose a definitive solution but to highlight the limitations of relying primarily on test accuracy as an evaluation metric, even when working with balanced datasets, by introducing the in-class data imbalance problem. By doing so, we aim to stimulate a critical discussion within the research community and open new avenues for research that consider a broader spectrum of model evaluation criteria. The anonymous code is available at https://github.com/PawPuk/CurvBIM blueunder the GPL-3.0 license.

Key facts. Cited by 1 paper in the map (data through 7 Oct 2026). Builds on 21 of its 49 references that are in the map. First posted on arXiv 22 Sep 2024.

Builds on

21 of 49 references.

References · 21

  1. 2019PyTorch: An Imperative Style, High-Performance Deep Learning Librarycited by 20,160
  2. 2014Explaining and Harnessing Adversarial Examplescited by 7,287
  3. 2017Fashion-MNIST: a Novel Image Dataset for Benchmarking Machine Learning Algorithmscited by 4,283
  4. 2020Energy-based Out-of-distribution Detectioncited by 1,296
  5. 2018AutoAugment: Learning Augmentation Policies from Datacited by 728
  6. 2017Decision-Based Adversarial Attacks: Reliable Attacks Against Black-Box Machine Learning Modelscited by 459
  7. 2018Deep Learning for Classical Japanese Literaturecited by 415
  8. 2021Pervasive Label Errors in Test Sets Destabilize Machine Learning Benchmarkscited by 388
  9. 2021The Intrinsic Dimension of Images and Its Impact on Learningcited by 307
  10. 2019Intrinsic dimension of data representations in deep neural networkscited by 276
  11. 2020Topology of deep neural networkscited by 111
  12. 2023DCdetector: Dual Attention Contrastive Representation Learning for Time Series Anomaly Detectioncited by 103
9 more
  1. 2020Contrastive Learning with Adversarial Examplescited by 91
  2. 2021Intrinsic Dimension, Persistent Homology and Generalization in Neural Networkscited by 70
  3. 2022The Effects of Regularization and Data Augmentation are Class Dependentcited by 67
  4. 2022AutoBalance: Optimized Loss Functions for Imbalanced Datacited by 49
  5. 2020Adversarial Examples on Object Recognition: A Comprehensive Surveycited by 23
  6. 2021Automatic Termination for Hyperparameter Optimizationcited by 21
  7. 2023Data Representations' Study of Latent Image Manifoldscited by 11
  8. 2023Better Practices for Domain Adaptationcited by 9
  9. 2023Neural Architecture Search for Visual Anomaly Segmentationcited by 2

Built on by

Cited by year

Citing papers per year: 2024: 1.

1 paper.