Feature Noise Boosts DNN Generalization under Label Noise
Not on the map. Why?
Abstract (arXiv)
The presence of label noise in the training data has a profound impact on the generalization of deep neural networks (DNNs). In this study, we introduce and theoretically demonstrate a simple feature noise method, which directly adds noise to the features of training data, can enhance the generalization of DNNs under label noise. Specifically, we conduct theoretical analyses to reveal that label noise leads to weakened DNN generalization by loosening the PAC-Bayes generalization bound, and feature noise results in better DNN generalization by imposing an upper bound on the mutual information between the model weights and the features, which constrains the PAC-Bayes generalization bound. Furthermore, to ensure effective generalization of DNNs in the presence of label noise, we conduct application analyses to identify the optimal types and levels of feature noise to add for obtaining desirable label noise generalization. Finally, extensive experimental results on several popular datasets demonstrate the feature noise method can significantly enhance the label noise generalization of the state-of-the-art label noise method.
Key facts. No citing papers in the map yet (data through 7 Oct 2026). Builds on 43 of its 76 references that are in the map. First posted on arXiv 3 Aug 2023.
Builds on
43 of 76 references.
References · 43
- 2015Deep Residual Learning for Image Recognitioncited by 51,809
- 2016Semi-Supervised Classification with Graph Convolutional Networkscited by 11,282
- 2014Explaining and Harnessing Adversarial Examplescited by 7,287
- 2017mixup: Beyond Empirical Risk Minimizationcited by 5,155
- 2017Fashion-MNIST: a Novel Image Dataset for Benchmarking Machine Learning Algorithmscited by 4,283
- 2013Deep Inside Convolutional Networks: Visualising Image Classification Models and Saliency Mapscited by 2,348
- 2016Matching Networks for One Shot Learningcited by 2,246
- 2019Natural Adversarial Examplescited by 1,401
- 2016On Large-Batch Training for Deep Learning: Generalization Gap and Sharp Minimacited by 1,337
- 2019Certified Adversarial Robustness via Randomized Smoothingcited by 1,324
- 2018Co-teaching: Robust Training of Deep Neural Networks with Extremely Noisy Labelscited by 1,053
- 2017A Closer Look at Memorization in Deep Networkscited by 936
31 more
- 2018Learning to Reweight Examples for Robust Deep Learningcited by 670
- 2019Deep Double Descent: Where Bigger Models and More Data Hurtcited by 667
- 2016Making Deep Neural Networks Robust to Label Noise: a Loss Correction Approachcited by 663
- 2017MentorNet: Learning Data-Driven Curriculum for Very Deep Neural Networks on Corrupted Labelscited by 652
- 2017Exploring Generalization in Deep Learningcited by 595
- 2017Computing Nonvacuous Generalization Bounds for Deep (Stochastic) Neural Networks with Many More Parameters than Training Datacited by 527
- 2020Early-Learning Regularization Prevents Memorization of Noisy Labelscited by 414
- 2019How does Disagreement Help Generalization against Label Corruption?cited by 390
- 2019Benchmarking Robustness in Object Detection: Autonomous Driving when Winter is Comingcited by 332
- 2017Information-theoretic analysis of generalization capability of learning algorithmscited by 299
- 2019A Fourier Perspective on Model Robustness in Computer Visioncited by 288
- 2017Emergence of Invariance and Disentanglement in Deep Representationscited by 213
- 2019Deep learning with noisy labels: exploring techniques and remedies in medical image analysiscited by 173
- 2017Deep Learning is Robust to Massive Label Noisecited by 164
- 2017Learning from Noisy Labels with Distillationcited by 160
- 2019Gradient Descent with Early Stopping is Provably Robust to Label Noise for Overparameterized Neural Networkscited by 158
- 2020Dual T: Reducing Estimation Error for Transition Matrix in Label-noise Learningcited by 142
- 2018Towards Understanding the Role of Over-Parametrization in Generalization of Neural Networkscited by 140
- 2016Information Dropout: Learning Optimal Representations Through Noisy Computationcited by 131
- 2019A Primer on PAC-Bayesian Learningcited by 130
- 2021Understanding and Improving Early Stopping for Learning with Noisy Labelscited by 112
- 2019Meta Label Correction for Noisy Label Learningcited by 108
- 2014Learning Ordered Representations with Nested Dropoutcited by 81
- 2022The alignment property of SGD noise and how it helps select flat minima: A stability analysiscited by 64
- 2021LatentCLR: A Contrastive Learning Approach for Unsupervised Discovery of Interpretable Directionscited by 52
- 2013A PAC-Bayesian Tutorial with A Dropout Boundcited by 43
- 2020Improving Generalization by Controlling Label-Noise Information in Neural Network Weightscited by 35
- 2021Boosting Co-teaching with Compression Regularization for Label Noisecited by 31
- 2020Artificial Neural Variability for Deep Learning: On Overfitting, Noise Memorization, and Catastrophic Forgettingcited by 28
- 2021How Tight Can PAC-Bayes be in the Small Data Regime?cited by 24
- 2022Implicit regularization of dropoutcited by 24
Built on by
Not cited yet.