Self-Augmentation Based on Noise-Robust Probabilistic Model For Noisy Labels

Citations

WEB OF SCIENCE

1
Citations

SCOPUS

1

초록

Learning deep neural networks from noisy labels is challenging, because high-capacity networks attempt to describe data even with noisy class labels. In this study, we propose a self-augmentation method without additional parameters, which handles noisy labeled data based on small-loss criteria. To this end, we use small-loss samples by introducing a noise-robust probabilistic model based on a Gaussian mixture model (GMM), in which small-loss samples follow class-conditional Gaussian distributions. With this sample augmentation using the GMM-based probabilistic model, we can effectively solve over-parameterization problems induced by label inconsistency in small-loss samples. We further enhance the quality of the small-loss samples using our data-adaptive selection strategy. Consequently, our method prevents networks from over-parameterization and enhances their generalization performance. Experimental results demonstrate that our method outperforms state-of-the-art methods for learning with noisy labels on several benchmark datasets. The proposed method produced a remarkable performance gap of up to 12% compared with the previous state-of-the-art methods on CIFAR dataset. Author

키워드

Noise measurement; Probabilistic logic; Mixture models; Gaussian distribution; Neural networks; Noise robustness; Computer vision; deep learning; probability distribution
제목
Self-Augmentation Based on Noise-Robust Probabilistic Model For Noisy Labels
저자
Park, B.W.; Park, S.W.; Kwon, Junseok
DOI
10.1109/ACCESS.2022.3219810
발행일
2022-11
유형
Article
저널명
IEEE Access
권
10
페이지
116141 ~ 116151

파일 다운로드

Thumbnail