mlsanityData to 14 Oct 2026

Constrained Instance and Class Reweighting for Robust Learning under Label Noise

arXiv 2111.05428 ↗First posted 9 Nov 2021cs.LG stat.MLcited by 12

Not on the map. Why?

Abstract (arXiv)

Deep neural networks have shown impressive performance in supervised learning, enabled by their ability to fit well to the provided training data. However, their performance is largely dependent on the quality of the training data and often degrades in the presence of noise. We propose a principled approach for tackling label noise with the aim of assigning importance weights to individual instances and class labels. Our method works by formulating a class of constrained optimization problems that yield simple closed form updates for these importance weights. The proposed optimization problems are solved per mini-batch which obviates the need of storing and updating the weights over the full dataset. Our optimization framework also provides a theoretical perspective on existing label smoothing heuristics for addressing label noise (such as label bootstrapping). We evaluate our method on several benchmark datasets and observe considerable performance gains in the presence of label noise.

Key facts. Cited by 12 papers in the map (data through 14 Oct 2026). Builds on 29 of its 49 references that are in the map. First posted on arXiv 9 Nov 2021.

Builds on

29 of 49 references.

References · 29

  1. 2015Rethinking the Inception Architecture for Computer Visioncited by 5,475
  2. 2017mixup: Beyond Empirical Risk Minimizationcited by 5,183
  3. 2016Identity Mappings in Deep Residual Networkscited by 1,965
  4. 2016Understanding deep learning requires rethinking generalizationcited by 1,674
  5. 2020Sharpness-Aware Minimization for Efficiently Improving Generalizationcited by 1,417
  6. 2018Co-teaching: Robust Training of Deep Neural Networks with Extremely Noisy Labelscited by 1,059
  7. 2017Virtual Adversarial Training: A Regularization Method for Supervised and Semi-Supervised Learningcited by 920
  8. 2020DivideMix: Learning with Noisy Labels as Semi-supervised Learningcited by 692
  9. 2018Learning to Reweight Examples for Robust Deep Learningcited by 675
  10. 2017MentorNet: Learning Data-Driven Curriculum for Very Deep Neural Networks on Corrupted Labelscited by 653
  11. 2016CVXPY: A Python-Embedded Modeling Language for Convex Optimizationcited by 641
  12. 2020Early-Learning Regularization Prevents Memorization of Noisy Labelscited by 416
17 more
  1. 2019Unsupervised Label Noise Modeling and Loss Correctioncited by 328
  2. 2014Training Deep Neural Networks on Noisy Labels with Bootstrappingcited by 322
  3. 2020Combating noisy labels by agreement: A joint training method with co-regularizationcited by 289
  4. 2020Normalized Loss Functions for Deep Learning with Noisy Labelscited by 257
  5. 2018Using Trusted Data to Train Deep Networks on Labels Corrupted by Severe Noisecited by 216
  6. 2020Does label smoothing mitigate label noise?cited by 204
  7. 2017A Rewriting System for Convex Optimization Problemscited by 179
  8. 2020Large-Scale Methods for Distributionally Robust Optimizationcited by 179
  9. 2019SELF: Learning to Filter Noisy Labels with Self-Ensemblingcited by 164
  10. 2019Gradient Descent with Early Stopping is Provably Robust to Label Noise for Overparameterized Neural Networkscited by 159
  11. 2019Peer Loss Functions: Learning from Noisy Labels without Knowing Noise Ratescited by 142
  12. 2020A Survey of Label-noise Representation Learning: Past, Present and Futurecited by 122
  13. 2019Robust Bi-Tempered Logistic Loss Based on Bregman Divergencescited by 61
  14. 2021Correlated Input-Dependent Label Noise in Large-Scale Image Classificationcited by 37
  15. 2021Exponentiated Gradient Reweighting for Robust Training Under Label Noise and Beyondcited by 16
  16. 2015Auxiliary Image Regularization for Deep CNNs with Noisy Labelscited by 14
  17. 2021Multiplicative Reweighting for Robust Neural Network Optimizationcited by 4

Built on by

Cited by year (2026 to 14 Oct)

Citing papers per year: 2021: 1; 2022: 3; 2023: 4; 2024: 1; 2025: 2; 2026: 1.

12 papers.