CVDec 21, 2022

Class Prototype-based Cleaner for Label Noise Learning

Peking U
arXiv:2212.10766v1h-index: 103Has Code
Originality Incremental advance
AI Analysis

This work addresses noisy-label learning for machine learning practitioners by proposing an incremental improvement over semi-supervised methods to better handle class-specific loss distributions.

The paper tackles the problem of noisy-label learning by addressing the class-agnostic assumption in existing methods, which leads to suboptimal label noise partition due to varying learning difficulty across classes. The proposed Class Prototype-based Cleaner (CPC) improves performance across benchmarks like CIFAR-10, CIFAR-100, Clothing1M, and WebVision, with consistent gains demonstrated in experiments.

Semi-supervised learning based methods are current SOTA solutions to the noisy-label learning problem, which rely on learning an unsupervised label cleaner first to divide the training samples into a labeled set for clean data and an unlabeled set for noise data. Typically, the cleaner is obtained via fitting a mixture model to the distribution of per-sample training losses. However, the modeling procedure is \emph{class agnostic} and assumes the loss distributions of clean and noise samples are the same across different classes. Unfortunately, in practice, such an assumption does not always hold due to the varying learning difficulty of different classes, thus leading to sub-optimal label noise partition criteria. In this work, we reveal this long-ignored problem and propose a simple yet effective solution, named \textbf{C}lass \textbf{P}rototype-based label noise \textbf{C}leaner (\textbf{CPC}). Unlike previous works treating all the classes equally, CPC fully considers loss distribution heterogeneity and applies class-aware modulation to partition the clean and noise data. CPC takes advantage of loss distribution modeling and intra-class consistency regularization in feature space simultaneously and thus can better distinguish clean and noise labels. We theoretically justify the effectiveness of our method by explaining it from the Expectation-Maximization (EM) framework. Extensive experiments are conducted on the noisy-label benchmarks CIFAR-10, CIFAR-100, Clothing1M and WebVision. The results show that CPC consistently brings about performance improvement across all benchmarks. Codes and pre-trained models will be released at \url{https://github.com/hjjpku/CPC.git}.

Code Implementations1 repo
Foundations

The foundational work for this paper's niche, ranked by how specifically the neighbourhood builds on it — not by global fame.

Your Notes