Empirical Study of Easy and Hard Examples in CNN Training
Not on the map. Why?
Abstract (arXiv)
Deep Neural Networks (DNNs) generalize well despite their massive size and capability of memorizing all examples. There is a hypothesis that DNNs start learning from simple patterns and the hypothesis is based on the existence of examples that are consistently well-classified at the early training stage (i.e., easy examples) and examples misclassified (i.e., hard examples). Easy examples are the evidence that DNNs start learning from specific patterns and there is a consistent learning process. It is important to know how DNNs learn patterns and obtain generalization ability, however, properties of easy and hard examples are not thoroughly investigated (e.g., contributions to generalization and visual appearances). In this work, we study the similarities of easy and hard examples respectively for different Convolutional Neural Network (CNN) architectures, assessing how those examples contribute to generalization. Our results show that easy examples are visually similar to each other and hard examples are visually diverse, and both examples are largely shared across different CNN architectures. Moreover, while hard examples tend to contribute more to generalization than easy examples, removing a large number of easy examples leads to poor generalization. By analyzing those results, we hypothesize that biases in a dataset and Stochastic Gradient Descent (SGD) are the reasons why CNNs have consistent easy and hard examples. Furthermore, we show that large scale classification datasets can be efficiently compressed by using easiness proposed in this work.
Key facts. Cited by 9 papers in the map (data through 14 Oct 2026). First posted on arXiv 25 Nov 2019.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2021: 1; 2022: 3; 2023: 2; 2024: 1; 2025: 1; 2026: 1.
9 papers.
- 2025Trustworthy Machine Learning via Memorization and the Granular Long-Tail: A Survey on Interactions, Tradeoffs, and Beyondcited by 6
- 2022What is Flagged in Uncertainty Quantification? Latent Density Models for Uncertainty Categorizationcited by 5
- 2022What Images are More Memorable to Machines?cited by 5
- 2023Differences Between Hard and Noisy-labeled Samples: An Empirical Studycited by 4
- 2023SoK: Memorisation in machine learningcited by 1
- 2024Angel or Devil: Discriminating Hard Samples and Anomaly Contaminations for Unsupervised Time Series Anomaly Detectioncited by 1
- 2026SynQ: Accurate Zero-shot Quantization by Synthesis-aware Fine-tuningcited by 1
- 2021Unified Regularity Measures for Sample-wise Learning and Generalizationcited by 0
- 2022Easy Batch Normalizationcited by 0
- 2026SynQ: Accurate Zero-shot Quantization by Synthesis-aware Fine-tuning19 Mar 2026
- 2025Trustworthy Machine Learning via Memorization and the Granular Long-Tail: A Survey on Interactions, Tradeoffs, and Beyond10 Mar 2025
- 2024Angel or Devil: Discriminating Hard Samples and Anomaly Contaminations for Unsupervised Time Series Anomaly Detection26 Oct 2024
- 2023SoK: Memorisation in machine learning6 Nov 2023
- 2023Differences Between Hard and Noisy-labeled Samples: An Empirical Study20 Jul 2023
- 2022What Images are More Memorable to Machines?14 Nov 2022
- 2022Easy Batch Normalization18 Jul 2022
- 2022What is Flagged in Uncertainty Quantification? Latent Density Models for Uncertainty Categorization11 Jul 2022
- 2021Unified Regularity Measures for Sample-wise Learning and Generalization9 Aug 2021