Which Samples Should be Learned First: Easy or Hard?
Not on the map. Why?
Abstract (arXiv)
An effective weighting scheme for training samples is essential for learning tasks. Numerous weighting schemes have been proposed. Some schemes take the easy-first mode, whereas some others take the hard-first one. Naturally, an interesting yet realistic question is raised. Which samples should be learned first given a new learning task, easy or hard? To answer this question, both theoretical analyses and experimental verification are conducted. First, a general optimized objective function is proposed, revealing the relationship between the difficulty distribution and the difficulty-based sample weights. Second, on the basis of the optimized objective function, theoretical answers are obtained. Besides the easy-first and hard-first modes, there are two other priority modes, namely, medium-first and two-ends-first. The prior mode does not necessarily remain unchanged during the training process. Third, an effective and universal solution is proposed to select the optimal priority mode when there is no prior knowledge or theoretical clues. The four modes, namely, easy/medium/hard/two-ends-first, can be flexibly switched in the proposed solution. Fourth, a wide range of experiments is conducted under various scenarios to further compare the weighting schemes in different modes. On the basis of these works, reasonable and comprehensive answers are obtained. Factors including the distribution of samples' learning difficulties and the validation data determine which samples should be learned first in a learning task.
Key facts. Cited by 12 papers in the map (data through 7 Oct 2026). Builds on 48 of its 100 references that are in the map. First posted on arXiv 11 Oct 2021.
Builds on
48 of 100 references.
References · 48
- 2015Deep Residual Learning for Image Recognitioncited by 51,809
- 2018BERT: Pre-training of Deep Bidirectional Transformers for Language Understandingcited by 40,204
- 2014Adam: A Method for Stochastic Optimizationcited by 36,960
- 2014Very Deep Convolutional Networks for Large-Scale Image Recognitioncited by 15,267
- 2017mixup: Beyond Empirical Risk Minimizationcited by 5,155
- 2015You Only Look Once: Unified, Real-Time Object Detectioncited by 4,829
- 2016Wide Residual Networkscited by 3,057
- 2020YOLOv4: Optimal Speed and Accuracy of Object Detectioncited by 1,624
- 2019Class-Balanced Loss Based on Effective Number of Samplescited by 1,239
- 2013Spectral Networks and Locally Connected Networks on Graphscited by 1,097
- 2018Co-teaching: Robust Training of Deep Neural Networks with Extremely Noisy Labelscited by 1,053
- 2018Pitfalls of Graph Neural Network Evaluationcited by 994
36 more
- 2019Learning Imbalanced Datasets with Label-Distribution-Aware Margin Losscited by 987
- 2016Revisiting Semi-Supervised Learning with Graph Embeddingscited by 970
- 2017A Closer Look at Memorization in Deep Networkscited by 936
- 2019DropEdge: Towards Deep Graph Convolutional Networks on Node Classificationcited by 679
- 2018Learning to Reweight Examples for Robust Deep Learningcited by 670
- 2017MentorNet: Learning Data-Driven Curriculum for Very Deep Neural Networks on Corrupted Labelscited by 652
- 2018FastGCN: Fast Learning with Graph Convolutional Networks via Importance Samplingcited by 583
- 2020Learning from Noisy Labels with Deep Neural Networks: A Surveycited by 580
- 2019Measuring and Relieving the Over-smoothing Problem for Graph Neural Networks from the Topological Viewcited by 544
- 2018Object Detection with Deep Learning: A Reviewcited by 524
- 2021Just Train Twice: Improving Group Robustness without Training Group Informationcited by 522
- 2020Generalized Focal Loss: Learning Qualified and Distributed Bounding Boxes for Dense Object Detectioncited by 408
- 2020Asymmetric Loss For Multi-Label Classificationcited by 379
- 2015Gradient-based Hyperparameter Optimization through Reversible Learningcited by 357
- 2018Not All Samples Are Created Equal: Deep Learning with Importance Samplingcited by 323
- 2014Training Deep Neural Networks on Noisy Labels with Bootstrappingcited by 322
- 2019On The Power of Curriculum Learning in Training Deep Networkscited by 285
- 2020Equalization Loss for Long-Tailed Object Recognitioncited by 285
- 2020Geometry-aware Instance-reweighted Adversarial Trainingcited by 198
- 2021Distribution Alignment: A Unified Framework for Long-tail Visual Recognitioncited by 198
- 2018Adaptive Sampling Towards Fast Graph Representation Learningcited by 180
- 2019Dice Loss for Data-imbalanced NLP Taskscited by 180
- 2018Large Scale Fine-Grained Categorization and Domain-Specific Transfer Learningcited by 174
- 2018Dimensionality-Driven Learning with Noisy Labelscited by 173
- 2015Cost Sensitive Learning of Deep Feature Representations from Imbalanced Datacited by 167
- 2020Rethinking Class-Balanced Methods for Long-Tailed Visual Recognition from a Domain Adaptation Perspectivecited by 143
- 2018Gradient Harmonized Single-stage Detectorcited by 114
- 2020Rethinking Bias-Variance Trade-off for Generalization of Neural Networkscited by 107
- 2020When Do Curricula Work?cited by 105
- 2021MetaSAug: Meta Semantic Augmentation for Long-Tailed Visual Recognitioncited by 99
- 2020Denoising Implicit Feedback for Recommendationcited by 80
- 2019Natural Language Understanding with the Quora Question Pairs Datasetcited by 51
- 2019L_DMI: An Information-theoretic Noise-robust Loss Functioncited by 26
- 2016Self-Paced Learning: an Implicit Regularization Perspectivecited by 21
- 2020Curriculum Learning with Diversity for Supervised Computer Vision Taskscited by 9
- 2020Which Strategies Matter for Noisy Label Classification? Insight into Loss and Uncertaintycited by 5
Built on by
Citing papers per year: 2022: 2; 2023: 3; 2024: 3; 2025: 3; 2026: 1.
12 papers.
- 2023On Diversified Preferences of Large Language Model Alignmentcited by 26
- 2023Understanding Difficulty-based Sample Weighting with a Universal Difficulty Measurecited by 9
- 2024Towards Explainable Artificial Intelligence (XAI): A Data Mining Perspectivecited by 9
- 2023Data Optimization in Deep Learning: A Surveycited by 6
- 2024Enhancing In-Context Learning via Implicit Demonstration Augmentationcited by 6
- 2022General Cyclical Training of Neural Networkscited by 5
- 2022Exploring the Learning Difficulty of Data Theory and Measurecited by 4
- 2025Dynamic Prototype Rehearsal for Continual ECG Arrhythmia Detectioncited by 4
- 2024A Safety-Adapted Loss for Pedestrian Detection in Automated Drivingcited by 2
- 2025When Active Learning Fails, Uncalibrated Out of Distribution Uncertainty Quantification Might Be the Problemcited by 1
- 2025LiLAW: Lightweight Learnable Adaptive Weighting to Learn Sample Difficulty & Improve Noisy Trainingcited by 0
- 2026Evolution-Inspired Sample Competition for Deep Neural Network Optimizationcited by 0
- 2026Evolution-Inspired Sample Competition for Deep Neural Network Optimization14 Apr 2026
- 2025When Active Learning Fails, Uncalibrated Out of Distribution Uncertainty Quantification Might Be the Problem21 Nov 2025
- 2025LiLAW: Lightweight Learnable Adaptive Weighting to Learn Sample Difficulty & Improve Noisy Training25 Sep 2025
- 2025Dynamic Prototype Rehearsal for Continual ECG Arrhythmia Detection13 Jan 2025
- 2024Enhancing In-Context Learning via Implicit Demonstration Augmentation27 Jun 2024
- 2024A Safety-Adapted Loss for Pedestrian Detection in Automated Driving5 Feb 2024
- 2024Towards Explainable Artificial Intelligence (XAI): A Data Mining Perspective9 Jan 2024
- 2023On Diversified Preferences of Large Language Model Alignment12 Dec 2023
- 2023Data Optimization in Deep Learning: A Survey25 Oct 2023
- 2023Understanding Difficulty-based Sample Weighting with a Universal Difficulty Measure12 Jan 2023
- 2022Exploring the Learning Difficulty of Data Theory and Measure16 May 2022
- 2022General Cyclical Training of Neural Networks17 Feb 2022