Per-Example Gradient Regularization Improves Learning Signals from Noisy Data
Not on the map. Why?
Abstract (arXiv)
Gradient regularization, as described in citetbarrett2021implicit, is a highly effective technique for promoting flat minima during gradient descent. Empirical evidence suggests that this regularization technique can significantly enhance the robustness of deep learning models against noisy perturbations, while also reducing test error. In this paper, we explore the per-example gradient regularization (PEGR) and present a theoretical analysis that demonstrates its effectiveness in improving both test error and robustness against noise perturbations. Specifically, we adopt a signal-noise data model from citetcao2022benign and show that PEGR can learn signals effectively while suppressing noise. In contrast, standard gradient descent struggles to distinguish the signal from the noise, leading to suboptimal generalization performance. Our analysis reveals that PEGR penalizes the variance of pattern learning, thus effectively suppressing the memorization of noises from the training data. These findings underscore the importance of variance control in deep learning training and offer useful insights for developing more effective training approaches.
Key facts. Cited by 7 papers in the map (data through 14 Oct 2026). Builds on 30 of its 36 references that are in the map. First posted on arXiv 31 Mar 2023.
Builds on
30 of 36 references.
References · 30
- 2020Sharpness-Aware Minimization for Efficiently Improving Generalizationcited by 1,417
- 2016On Large-Batch Training for Deep Learning: Generalization Gap and Sharp Minimacited by 1,352
- 2019Benign Overfitting in Linear Regressioncited by 549
- 2019Surprises in High-Dimensional Ridgeless Least Squares Interpolationcited by 513
- 2019Fantastic Generalization Measures and Where to Find Themcited by 513
- 2019The generalization error of random features regression: Precise asymptotics and double descent curvecited by 413
- 2020Towards Understanding Ensemble, Knowledge Distillation and Self-Distillation in Deep Learningcited by 297
- 2017Three Factors Influencing Minima in SGDcited by 273
- 2018Implicit Self-Regularization in Deep Neural Networks: Evidence from Random Matrix Theory and Implications for Learningcited by 215
- 2021On the Origin of Implicit Regularization in Stochastic Gradient Descentcited by 184
- 2020Implicit Gradient Regularizationcited by 146
- 2022Towards Understanding Sharpness-Aware Minimizationcited by 146
18 more
- 2019Implicit regularization for deep neural networks driven by an Ornstein-Uhlenbeck like processcited by 123
- 2022Penalizing Gradient Norm for Efficiently Improving Generalization in Deep Learningcited by 122
- 2020On the Optimal Weighted ℓ2 Regularization in Overparameterized Linear Regressioncited by 98
- 2017Regularization for Deep Learning: A Taxonomycited by 91
- 2022Benign Overfitting in Two-layer Convolutional Neural Networkscited by 91
- 2020On the Generalization Benefit of Noise in Stochastic Gradient Descentcited by 82
- 2020Finite-sample Analysis of Interpolating Linear Classifiers in the Overparameterized Regimecited by 81
- 2022Benign Overfitting without Linearity: Neural Network Classifiers Trained by Gradient Descent for Noisy Linear Datacited by 74
- 2021Benign Overfitting of Constant-Stepsize SGD for Linear Regressioncited by 71
- 2022How Does Sharpness-Aware Minimization Minimize Sharpness?cited by 65
- 2021Stochastic Training is Not Necessary for Generalizationcited by 63
- 2021Risk Bounds for Over-parameterized Maximum Margin Classification on Sub-Gaussian Mixturescited by 49
- 2021Understanding the Generalization of Adam in Learning Neural Networks with Proper Regularizationcited by 49
- 2022Why neural networks find simple solutions: the many regularizers of geometric complexitycited by 39
- 2023Benign Overfitting for Two-layer ReLU Convolutional Neural Networkscited by 34
- 2023The Benefits of Mixup for Feature Learningcited by 19
- 2021Impact of classification difficulty on the weight matrices spectra in Deep Learning and application to early-stoppingcited by 12
- 2022Multiple Descent in the Multiple Random Feature Modelcited by 10
Built on by
Citing papers per year: 2023: 3; 2024: 3; 2025: 1.
7 papers.
- 2023Why Does Sharpness-Aware Minimization Generalize Better Than SGD?cited by 28
- 2024Why is SAM Robust to Label Noise?cited by 21
- 2025Mid-Training of Large Language Models: A Surveycited by 21
- 2024On the Feature Learning in Diffusion Modelscited by 20
- 2023Quantifying the Optimization and Generalization Advantages of Graph Neural Networks Over Multilayer Perceptronscited by 12
- 2023Benign Overfitting in Two-Layer ReLU Convolutional Neural Networks for XOR Datacited by 10
- 2024Sharpness-Aware Minimization Enhances Feature Quality via Balanced Learningcited by 9
- 2025Mid-Training of Large Language Models: A Survey8 Oct 2025
- 2024On the Feature Learning in Diffusion Models2 Dec 2024
- 2024Sharpness-Aware Minimization Enhances Feature Quality via Balanced Learning30 May 2024
- 2024Why is SAM Robust to Label Noise?6 May 2024
- 2023Why Does Sharpness-Aware Minimization Generalize Better Than SGD?11 Oct 2023
- 2023Benign Overfitting in Two-Layer ReLU Convolutional Neural Networks for XOR Data3 Oct 2023
- 2023Quantifying the Optimization and Generalization Advantages of Graph Neural Networks Over Multilayer Perceptrons24 Jun 2023