DiscrimLoss: A Universal Loss for Hard Samples and Incorrect Samples Discrimination
Not on the map. Why?
Abstract (arXiv)
Given data with label noise (i.e., incorrect data), deep neural networks would gradually memorize the label noise and impair model performance. To relieve this issue, curriculum learning is proposed to improve model performance and generalization by ordering training samples in a meaningful (e.g., easy to hard) sequence. Previous work takes incorrect samples as generic hard ones without discriminating between hard samples (i.e., hard samples in correct data) and incorrect samples. Indeed, a model should learn from hard samples to promote generalization rather than overfit to incorrect ones. In this paper, we address this problem by appending a novel loss function DiscrimLoss, on top of the existing task loss. Its main effect is to automatically and stably estimate the importance of easy samples and difficult samples (including hard and incorrect samples) at the early stages of training to improve the model performance. Then, during the following stages, DiscrimLoss is dedicated to discriminating between hard and incorrect samples to improve the model generalization. Such a training strategy can be formulated dynamically in a self-supervised manner, effectively mimicking the main principle of curriculum learning. Experiments on image classification, image regression, text sequence regression, and event relation reasoning demonstrate the versatility and effectiveness of our method, particularly in the presence of diversified noise levels.
Key facts. Cited by 5 papers in the map (data through 7 Oct 2026). Builds on 33 of its 62 references that are in the map. First posted on arXiv 21 Aug 2022.
Builds on
33 of 62 references.
References · 33
- 2015Deep Residual Learning for Image Recognitioncited by 51,809
- 2018BERT: Pre-training of Deep Bidirectional Transformers for Language Understandingcited by 40,204
- 2019RoBERTa: A Robustly Optimized BERT Pretraining Approachcited by 13,266
- 2019XLNet: Generalized Autoregressive Pretraining for Language Understandingcited by 2,801
- 2016Understanding deep learning requires rethinking generalizationcited by 1,657
- 2018Co-teaching: Robust Training of Deep Neural Networks with Extremely Noisy Labelscited by 1,053
- 2020DivideMix: Learning with Noisy Labels as Semi-supervised Learningcited by 691
- 2018Learning to Reweight Examples for Robust Deep Learningcited by 670
- 2018An Empirical Study of Example Forgetting during Deep Neural Network Learningcited by 669
- 2013Speech Recognition with Deep Recurrent Neural Networkscited by 666
- 2016Making Deep Neural Networks Robust to Label Noise: a Loss Correction Approachcited by 663
- 2017MentorNet: Learning Data-Driven Curriculum for Very Deep Neural Networks on Corrupted Labelscited by 652
21 more
- 2021Deep Learning on a Data Diet: Finding Important Examples Early in Trainingcited by 529
- 2022Beyond neural scaling laws: beating power law scaling via data pruningcited by 519
- 2017Age Progression/Regression by Conditional Adversarial Autoencodercited by 426
- 2020Hard Negative Mixing for Contrastive Learningcited by 399
- 2019How does Disagreement Help Generalization against Label Corruption?cited by 390
- 2020Combating noisy labels by agreement: A joint training method with co-regularizationcited by 289
- 2019On The Power of Curriculum Learning in Training Deep Networkscited by 285
- 2015Non-stochastic Best Arm Identification and Hyperparameter Optimizationcited by 219
- 2019KagNet: Knowledge-Aware Graph Networks for Commonsense Reasoningcited by 216
- 2019SELF: Learning to Filter Noisy Labels with Self-Ensemblingcited by 164
- 2020Scalable Multi-Hop Relational Reasoning for Knowledge-Aware Question Answeringcited by 122
- 2019Curriculum Loss: Robust Learning and Generalization against Label Corruptioncited by 87
- 2020Reasoning about Goals, Steps, and Temporal Ordering with WikiHowcited by 66
- 2020Curriculum Pre-training for End-to-End Speech Translationcited by 57
- 2016Visualizing and Understanding Curriculum Learning for Long Short-Term Memory Networkscited by 44
- 2020Breaking the Curse of Space Explosion: Towards Efficient NAS with Curriculum Searchcited by 33
- 2021Guided Generation of Cause and Effectcited by 33
- 2015What to talk about and how? Selective Generation using LSTMs with Coarse-to-Fine Alignmentcited by 31
- 2019Image Difficulty Curriculum for Generative Adversarial Networks (CuGAN)cited by 23
- 2016Exploiting Web Images for Dataset Construction: A Domain Robust Approachcited by 22
- 2020Reinforced Curriculum Learning on Pre-trained Neural Machine Translation Modelscited by 20
Built on by
Citing papers per year: 2023: 2; 2024: 2; 2025: 1.
5 papers.
- 2023Feature Matching Data Synthesis for Non-IID Federated Learningcited by 13
- 2023NoisywikiHow: A Benchmark for Learning with Real-world Noisy Labels in Natural Language Processingcited by 8
- 2024AdaKD: Dynamic Knowledge Distillation of ASR models using Adaptive Loss Weightingcited by 3
- 2024Robust Noisy Label Learning via Two-Stream Sample Distillationcited by 1
- 2025Label-Noise Resistant Learning via Optimal Brain Damage Maskingcited by 0
- 2025Label-Noise Resistant Learning via Optimal Brain Damage Masking13 Aug 2025
- 2024AdaKD: Dynamic Knowledge Distillation of ASR models using Adaptive Loss Weighting11 May 2024
- 2024Robust Noisy Label Learning via Two-Stream Sample Distillation16 Apr 2024
- 2023Feature Matching Data Synthesis for Non-IID Federated Learning9 Aug 2023
- 2023NoisywikiHow: A Benchmark for Learning with Real-world Noisy Labels in Natural Language Processing18 May 2023