How Does Label Noise Gradient Descent Improve Generalization in the Low SNR Regime?
Not on the map. Why?
Abstract (arXiv)
The capacity of deep learning models is often large enough to both learn the underlying statistical signal and overfit to noise in the training set. This noise memorization can be harmful especially for data with a low signal-to-noise ratio (SNR), leading to poor generalization. Inspired by prior observations that label noise provides implicit regularization that improves generalization, in this work, we investigate whether introducing label noise to the gradient updates can enhance the test performance of neural network (NN) in the low SNR regime. Specifically, we consider training a two-layer NN with a simple label noise gradient descent (GD) algorithm, in an idealized signal-noise data setting. We prove that adding label noise during training suppresses noise memorization, preventing it from dominating the learning process; consequently, label noise GD enjoys rapid signal growth while the overfitting remains controlled, thereby achieving good generalization despite the low SNR. In contrast, we also show that NN trained with standard GD tends to overfit to noise in the same low SNR setting and establish a non-vanishing lower bound on its test error, thus demonstrating the benefit of introducing label noise in gradient-based training.
Key facts. Cited by 4 papers in the map (data through 14 Oct 2026). Builds on 51 of its 62 references that are in the map. First posted on arXiv 20 Oct 2025.
Builds on
51 of 62 references.
References · 51
- 2018BERT: Pre-training of Deep Bidirectional Transformers for Language Understandingcited by 40,399
- 2020Language Models are Few-Shot Learnerscited by 32,419
- 2015Rethinking the Inception Architecture for Computer Visioncited by 5,475
- 2013Rich feature hierarchies for accurate object detection and semantic segmentationcited by 2,162
- 2020Sharpness-Aware Minimization for Efficiently Improving Generalizationcited by 1,417
- 2018On the Spectral Bias of Neural Networkscited by 1,341
- 2019Benign Overfitting in Linear Regressioncited by 549
- 2020Towards Understanding Ensemble, Knowledge Distillation and Self-Distillation in Deep Learningcited by 297
- 2020Implicit Bias of Gradient Descent for Wide Two-layer Neural Networks Trained with the Logistic Losscited by 268
- 2018Measuring the Effects of Data Parallelism on Neural Network Trainingcited by 193
- 2022Neural Networks can Learn Representations with Gradient Descentcited by 161
- 2020Benign overfitting in ridge regressioncited by 153
38 more
- 2020When Do Neural Networks Outperform Kernel Methods?cited by 150
- 2022High-dimensional Asymptotics of Feature Learning: How One Gradient Step Improves the Representationcited by 150
- 2019Implicit regularization for deep neural networks driven by an Ornstein-Uhlenbeck like processcited by 123
- 2021Label Noise SGD Provably Prefers Flat Global Minimizerscited by 121
- 2021Toward Understanding the Feature Learning Process of Self-supervised Contrastive Learningcited by 119
- 2020Feature Purification: How Adversarial Training Performs Robust Deep Learningcited by 107
- 2021What Happens after SGD Reaches Zero Loss? --A Mathematical Frameworkcited by 107
- 2022Vision Transformers provably learn spatial structurecited by 93
- 2022Benign Overfitting in Two-layer Convolutional Neural Networkscited by 91
- 2020Shape Matters: Understanding the Implicit Bias of the Noise Covariancecited by 88
- 2023A Theoretical Understanding of Shallow Vision Transformers: Learning, Generalization, and Sample Complexitycited by 77
- 2022Benign Overfitting without Linearity: Neural Network Classifiers Trained by Gradient Descent for Noisy Linear Datacited by 74
- 2022High-dimensional limit theorems for SGD: Effective dynamics and critical scalingcited by 70
- 2022Towards Understanding Mixture of Experts in Deep Learningcited by 52
- 2023On the Role of Attention in Prompt-tuningcited by 50
- 2021Understanding the Generalization of Adam in Learning Neural Networks with Proper Regularizationcited by 49
- 2020How benign is benign overfitting?cited by 40
- 2022Towards understanding how momentum improves generalization in deep learningcited by 40
- 2023SGD Finds then Tunes Features in Two-Layer Neural Networks with near-Optimal Sample Complexity: A Case Study in the XOR problemcited by 39
- 2022The Implicit Bias of Benign Overfittingcited by 38
- 2023Benign Overfitting for Two-layer ReLU Convolutional Neural Networkscited by 34
- 2023Benign Overfitting and Grokking in ReLU Networks for XOR Cluster Datacited by 33
- 2020Regularization via Structural Label Smoothingcited by 29
- 2022Label noise (stochastic) gradient descent implicitly solves the Lasso for quadratic parametrisationcited by 29
- 2023Why Does Sharpness-Aware Minimization Generalize Better Than SGD?cited by 28
- 2024Nonlinear spiked covariance matrices and signal propagation in deep neural networkscited by 26
- 2024On the Feature Learning in Diffusion Modelscited by 20
- 2023The Benefits of Mixup for Feature Learningcited by 19
- 2020Benign Overfitting and Noisy Featurescited by 18
- 2024Unveil Benign Overfitting for Transformer in Vision: Training Dynamics, Convergence, and Generalizationcited by 17
- 2022Provably Learning Diverse Features in Multi-View Data with Midpoint Mixupcited by 14
- 2024What Improves the Generalization of Graph Transformers? A Theoretical Dive into the Self-attention and Positional Encodingcited by 14
- 2024Mean-field Analysis on Two-layer Neural Networks from a Kernel Perspectivecited by 13
- 2023Quantifying the Optimization and Generalization Advantages of Graph Neural Networks Over Multilayer Perceptronscited by 12
- 2024On the Optimization and Generalization of Two-layer Transformers with Sign Gradient Descentcited by 12
- 2024On the Comparison between Multi-modal and Single-modal Contrastive Learningcited by 10
- 2023Benign Oscillation of Stochastic Gradient Descent with Large Learning Ratescited by 8
- 2025On the Role of Label Noise in the Feature Learning Processcited by 4
50 most cited of 51 All 51 (JSON)
Built on by
Citing papers per year: 2026: 4.
4 papers.
- 2026Does SGD Seek Flatness or Sharpness? An Exactly Solvable Modelcited by 1
- 2026Differential Privacy in Two-Layer Networks: How DP-SGD Harms Fairness and Robustnesscited by 1
- 2026On the Learning Dynamics of Two-layer Linear Networks with Label Noise SGDcited by 0
- 2026The Conflict Between Logic and Memory: Training Conditions for Optimizer-Dependent Rule Acquisitioncited by 0
- 2026The Conflict Between Logic and Memory: Training Conditions for Optimizer-Dependent Rule Acquisition30 Sep 2026
- 2026On the Learning Dynamics of Two-layer Linear Networks with Label Noise SGD11 Mar 2026
- 2026Differential Privacy in Two-Layer Networks: How DP-SGD Harms Fairness and Robustness5 Mar 2026
- 2026Does SGD Seek Flatness or Sharpness? An Exactly Solvable Model4 Feb 2026