mlsanityData to 14 Oct 2026

Prototypical Classifier for Robust Class-Imbalanced Learning

arXiv 2110.11553 ↗First posted 22 Oct 2021cs.CVcited by 10

Not on the map. Why?

Abstract (arXiv)

Deep neural networks have been shown to be very powerful methods for many supervised learning tasks. However, they can also easily overfit to training set biases, i.e., label noise and class imbalance. While both learning with noisy labels and class-imbalanced learning have received tremendous attention, existing works mainly focus on one of these two training set biases. To fill the gap, we propose textitPrototypical Classifier, which does not require fitting additional parameters given the embedding network. Unlike conventional classifiers that are biased towards head classes, Prototypical Classifier produces balanced and comparable predictions for all classes even though the training set is class-imbalanced. By leveraging this appealing property, we can easily detect noisy labels by thresholding the confidence scores predicted by Prototypical Classifier, where the threshold is dynamically adjusted through the iteration. A sample reweghting strategy is then applied to mitigate the influence of noisy labels. We test our method on CIFAR-10-LT, CIFAR-100-LT and Webvision datasets, observing that Prototypical Classifier obtains substaintial improvements compared with state of the arts.

Key facts. Cited by 10 papers in the map (data through 14 Oct 2026). Builds on 27 of its 33 references that are in the map. First posted on arXiv 22 Oct 2021.

Builds on

27 of 33 references.

References · 27

  1. 2017mixup: Beyond Empirical Risk Minimizationcited by 5,183
  2. 2017Prototypical Networks for Few-shot Learningcited by 3,015
  3. 2019Class-Balanced Loss Based on Effective Number of Samplescited by 1,245
  4. 2018Co-teaching: Robust Training of Deep Neural Networks with Extremely Noisy Labelscited by 1,059
  5. 2019Learning Imbalanced Datasets with Label-Distribution-Aware Margin Losscited by 989
  6. 2019AugMix: A Simple Data Processing Method to Improve Robustness and Uncertaintycited by 901
  7. 2019Decoupling Representation and Classifier for Long-Tailed Recognitioncited by 809
  8. 2019Large-Scale Long-Tailed Recognition in an Open Worldcited by 705
  9. 2020DivideMix: Learning with Noisy Labels as Semi-supervised Learningcited by 692
  10. 2018Learning to Reweight Examples for Robust Deep Learningcited by 675
  11. 2017MentorNet: Learning Data-Driven Curriculum for Very Deep Neural Networks on Corrupted Labelscited by 653
  12. 2020Prototypical Contrastive Learning of Unsupervised Representationscited by 640
15 more
  1. 2020Long-tail learning via logit adjustmentcited by 618
  2. 2020Early-Learning Regularization Prevents Memorization of Noisy Labelscited by 416
  3. 2019BBN: Bilateral-Branch Network with Cumulative Learning for Long-Tailed Visual Recognitioncited by 403
  4. 2020Balanced Meta-Softmax for Long-Tailed Visual Recognitioncited by 400
  5. 2017WebVision Database: Visual Learning and Understanding from Web Datacited by 262
  6. 2020Identifying Mislabeled Data using the Area Under the Margin Rankingcited by 261
  7. 2020Long-Tailed Classification by Keeping the Good and Removing the Bad Momentum Causal Effectcited by 256
  8. 2020Rethinking the Value of Labels for Improving Class-Imbalanced Learningcited by 216
  9. 2020Rethinking Class-Balanced Methods for Long-Tailed Visual Recognition from a Domain Adaptation Perspectivecited by 143
  10. 2015Relay Backpropagation for Effective Learning of Deep Convolutional Neural Networkscited by 115
  11. 2020MoPro: Webly Supervised Learning with Momentum Prototypescited by 66
  12. 2021NGC: A Unified Framework for Learning with Open-World Noisy Datacited by 58
  13. 2020Heteroskedastic and Imbalanced Deep Learning with Adaptive Regularizationcited by 49
  14. 2021Robust Long-Tailed Learning under Label Noisecited by 36
  15. 2021Learning From Long-Tailed Data With Noisy Labelscited by 17

Built on by

Cited by year (2026 to 14 Oct)

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

10 papers.