Mitigating Memorization in Sample Selection for Learning with Noisy Labels
Kyeongbo Kong, Junggi Lee, Youngchul Kwak, Young-Rae Cho, Seong-Eun, Kim, and Woo-Jin Song

TL;DR
This paper introduces a class-wise penalty label method to improve sample selection, making deep learning more robust to noisy labels, especially when some classes dominate label corruption.
Contribution
It proposes a novel class-wise penalty label criterion to better identify and penalize dominant-noisy-labeled samples during training.
Findings
Improved robustness to noisy labels across multiple datasets.
Significant performance gains over existing methods.
Effective in various noise scenarios.
Abstract
Because deep learning is vulnerable to noisy labels, sample selection techniques, which train networks with only clean labeled data, have attracted a great attention. However, if the labels are dominantly corrupted by few classes, these noisy samples are called dominant-noisy-labeled samples, the network also learns dominant-noisy-labeled samples rapidly via content-aware optimization. In this study, we propose a compelling criteria to penalize dominant-noisy-labeled samples intensively through class-wise penalty labels. By averaging prediction confidences for the each observed label, we obtain suitable penalty labels that have high values if the labels are largely corrupted by some classes. Experiments were performed using benchmarks (CIFAR-10, CIFAR-100, Tiny-ImageNet) and real-world datasets (ANIMAL-10N, Clothing1M) to evaluate the proposed criteria in various scenarios with…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsMachine Learning and Data Classification · Anomaly Detection Techniques and Applications · Machine Learning and Algorithms
