On the Generalization of Models Trained with SGD: Information-Theoretic Bounds and Implications
Not on the map. Why?
Abstract (arXiv)
This paper follows up on a recent work of Neu et al. (2021) and presents some new information-theoretic upper bounds for the generalization error of machine learning models, such as neural networks, trained with SGD. We apply these bounds to analyzing the generalization behaviour of linear and two-layer ReLU networks. Experimental study of these bounds provide some insights on the SGD training of neural networks. They also point to a new and simple regularization scheme which we show performs comparably to the current state of the art.
Key facts. Cited by 31 papers in the map (data through 14 Oct 2026). Builds on 58 of its 85 references that are in the map. First posted on arXiv 7 Oct 2021.
Builds on
58 of 85 references.
References · 58
- 2019PyTorch: An Imperative Style, High-Performance Deep Learning Librarycited by 20,305
- 2014Very Deep Convolutional Networks for Large-Scale Image Recognitioncited by 15,364
- 2014Explaining and Harnessing Adversarial Examplescited by 7,364
- 2015Rethinking the Inception Architecture for Computer Visioncited by 5,475
- 2017mixup: Beyond Empirical Risk Minimizationcited by 5,183
- 2018Deep contextualized word representationscited by 2,290
- 2016Identity Mappings in Deep Residual Networkscited by 1,965
- 2016Understanding deep learning requires rethinking generalizationcited by 1,674
- 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
- 2016Optimization Methods for Large-Scale Machine Learningcited by 1,150
- 2018Reconciling modern machine learning practice and the bias-variance trade-offcited by 927
38 more
- 2018A Convergence Theory for Deep Learning via Over-Parameterizationcited by 787
- 2017Spectrally-normalized margin bounds for neural networkscited by 686
- 2019Deep Double Descent: Where Bigger Models and More Data Hurtcited by 672
- 2017Exploring Generalization in Deep Learningcited by 600
- 2019Fine-Grained Analysis of Optimization and Generalization for Overparameterized Two-Layer Neural Networkscited by 566
- 2015Train faster, generalize better: Stability of stochastic gradient descentcited by 552
- 2017Computing Nonvacuous Generalization Bounds for Deep (Stochastic) Neural Networks with Many More Parameters than Training Datacited by 533
- 2019Fantastic Generalization Measures and Where to Find Themcited by 513
- 2017Sharp Minima Can Generalize For Deep Netscited by 466
- 2016Entropy-SGD: Biasing Gradient Descent Into Wide Valleyscited by 359
- 2019Why gradient clipping accelerates training: A theoretical justification for adaptivitycited by 341
- 2017A PAC-Bayesian Approach to Spectrally-Normalized Margin Bounds for Neural Networkscited by 314
- 2018Stronger generalization bounds for deep nets via a compression approachcited by 307
- 2017Information-theoretic analysis of generalization capability of learning algorithmscited by 303
- 2015Norm-Based Capacity Control in Neural Networkscited by 299
- 2019PyHessian: Neural Networks Through the Lens of the Hessiancited by 292
- 2017Three Factors Influencing Minima in SGDcited by 273
- 2017Regularizing and Optimizing LSTM Language Modelscited by 205
- 2020Stability of Stochastic Gradient Descent on Nonsmooth Convex Lossescited by 173
- 2020Reasoning About Generalization via Conditional Mutual Informationcited by 147
- 2018Towards Understanding the Role of Over-Parametrization in Generalization of Neural Networkscited by 142
- 2019Information-Theoretic Generalization Bounds for SGLD via Data-Dependent Estimatescited by 119
- 2020Fine-Grained Analysis of Stability and Generalization for Stochastic Gradient Descentcited by 119
- 2019Tightening Mutual Information Based Bounds on Generalization Errorcited by 117
- 2020Rethinking Bias-Variance Trade-off for Generalization of Neural Networkscited by 107
- 2019High probability generalization bounds for uniformly stable algorithms with nearly optimal ratecited by 98
- 2015How much does your data exploration overfit? Controlling bias via information usagecited by 95
- 2020Sharpened Generalization Bounds based on Conditional Mutual Information and an Application to Noisy, Iterative Algorithmscited by 89
- 2021Information-Theoretic Generalization Bounds for Stochastic Gradient Descentcited by 84
- 2015Generalization in Adaptive Data Analysis and Holdout Reusecited by 83
- 2018Generalization Error Bounds for Noisy, Iterative Algorithmscited by 82
- 2019BackPACK: Packing more into backpropcited by 78
- 2020Regularizing Neural Networks via Adversarial Model Perturbationcited by 78
- 2020The Implicit and Explicit Regularization Effects of Dropoutcited by 71
- 2018Chaining Mutual Information and Tightening Generalization Boundscited by 65
- 2020Do We Need Zero Training Loss After Achieving Zero Training Error?cited by 61
- 2018Stability and Convergence Trade-off of Iterative Optimization Algorithmscited by 53
- 2020Explicit Regularisation in Gaussian Noise Injectionscited by 37
50 most cited of 58 All 58 (JSON)
Built on by
Citing papers per year: 2022: 4; 2023: 7; 2024: 11; 2025: 7; 2026: 2.
31 papers.
Sort:
- 2022Towards Understanding Sharpness-Aware Minimizationcited by 146
- 2023Enhancing Sharpness-Aware Optimization Through Variance Suppressioncited by 37
- 2023Tighter Information-Theoretic Generalization Bounds from Supersamplescited by 22
- 2024Flat-LoRA: Low-Rank Adaptation over a Flat Loss Landscapecited by 20
- 2022Limitations of Information-Theoretic Generalization Bounds for Gradient Descent Methods in Stochastic Convex Optimizationcited by 19
- 2022Information-Theoretic Analysis of Unsupervised Domain Adaptationcited by 15
- 2023Over-training with Mixup May Hurt Generalizationcited by 13
- 2024Revisiting Random Weight Perturbation for Efficiently Improving Generalizationcited by 13
- 2023Time-Independent Information-Theoretic Generalization Bounds for SGLDcited by 12
- 2022Two Facets of SDE Under an Information-Theoretic Lens: Generalization of SGD via Training Trajectories and via Terminal Statescited by 11
- 2024Information-Theoretic Generalization Bounds for Deep Neural Networkscited by 10
- 2024Implicit Regularization of Sharpness-Aware Minimization for Scale-Invariant Problemscited by 10
19 more
- 2024Soften to Defend: Towards Adversarial Robustness via Self-Guided Label Refinementcited by 9
- 2023Sample-Conditioned Hypothesis Stability Sharpens Information-Theoretic Generalization Boundscited by 6
- 2023Understanding the Generalization Ability of Deep Learning Algorithms: A Kernelized Renyi's Entropy Perspectivecited by 5
- 2024Generalization Bounds via Conditional f-Informationcited by 4
- 2024How Does Distribution Matching Help Domain Generalization: An Information-theoretic Analysiscited by 3
- 2024Towards Understanding Epoch-wise Double descent in Two-layer Linear Neural Networkscited by 3
- 2025Fairness Overfitting in Machine Learning: An Information-Theoretic Perspectivecited by 3
- 2023Information-Theoretic Generalization Bounds for Transductive Learning and its Applicationscited by 2
- 2024Class-wise Generalization Error: an Information-Theoretic Analysiscited by 2
- 2025Information-Theoretic Generalization Bounds of Replay-based Continual Learningcited by 2
- 2025Unveiling m-Sharpness Through the Structure of Stochastic Gradient Noisecited by 2
- 2026Leveraging Flatness to Improve Information-Theoretic Generalization Bounds for SGDcited by 2
- 2024Sharpness-Aware Minimization for Evolutionary Feature Construction in Regressioncited by 1
- 2025VASSO: Variance Suppression for Sharpness-Aware Minimizationcited by 1
- 2024Error Bounds of Supervised Classification from Information-Theoretic Perspectivecited by 0
- 2025Information-theoretic Generalization Analysis for VQ-VAEs: A Role of Latent Variablescited by 0
- 2025Tight Generalization Error Bounds for Stochastic Gradient Descent in Non-convex Learningcited by 0
- 2025Stable Coresets via Posterior Sampling: Aligning Induced and Full Loss Landscapescited by 0
- 2026Information-Theoretic Generalization Bounds for Sequential Decision Makingcited by 0
- 2026Information-Theoretic Generalization Bounds for Sequential Decision Making12 May 2026
- 2026Leveraging Flatness to Improve Information-Theoretic Generalization Bounds for SGD4 Jan 2026
- 2025Stable Coresets via Posterior Sampling: Aligning Induced and Full Loss Landscapes21 Nov 2025
- 2025Unveiling m-Sharpness Through the Structure of Stochastic Gradient Noise22 Sep 2025
- 2025VASSO: Variance Suppression for Sharpness-Aware Minimization2 Sep 2025
- 2025Information-Theoretic Generalization Bounds of Replay-based Continual Learning16 Jul 2025
- 2025Tight Generalization Error Bounds for Stochastic Gradient Descent in Non-convex Learning23 Jun 2025
- 2025Fairness Overfitting in Machine Learning: An Information-Theoretic Perspective9 Jun 2025
- 2025Information-theoretic Generalization Analysis for VQ-VAEs: A Role of Latent Variables26 May 2025
- 2024Generalization Bounds via Conditional f-Information30 Oct 2024
- 2024Implicit Regularization of Sharpness-Aware Minimization for Scale-Invariant Problems18 Oct 2024
- 2024Flat-LoRA: Low-Rank Adaptation over a Flat Loss Landscape22 Sep 2024
19 more
- 2024Towards Understanding Epoch-wise Double descent in Two-layer Linear Neural Networks13 Jul 2024
- 2024How Does Distribution Matching Help Domain Generalization: An Information-theoretic Analysis14 Jun 2024
- 2024Error Bounds of Supervised Classification from Information-Theoretic Perspective7 Jun 2024
- 2024Sharpness-Aware Minimization for Evolutionary Feature Construction in Regression11 May 2024
- 2024Information-Theoretic Generalization Bounds for Deep Neural Networks4 Apr 2024
- 2024Revisiting Random Weight Perturbation for Efficiently Improving Generalization30 Mar 2024
- 2024Soften to Defend: Towards Adversarial Robustness via Self-Guided Label Refinement14 Mar 2024
- 2024Class-wise Generalization Error: an Information-Theoretic Analysis5 Jan 2024
- 2023Information-Theoretic Generalization Bounds for Transductive Learning and its Applications8 Nov 2023
- 2023Time-Independent Information-Theoretic Generalization Bounds for SGLD2 Nov 2023
- 2023Sample-Conditioned Hypothesis Stability Sharpens Information-Theoretic Generalization Bounds31 Oct 2023
- 2023Enhancing Sharpness-Aware Optimization Through Variance Suppression27 Sep 2023
- 2023Understanding the Generalization Ability of Deep Learning Algorithms: A Kernelized Renyi's Entropy Perspective2 May 2023
- 2023Over-training with Mixup May Hurt Generalization2 Mar 2023
- 2023Tighter Information-Theoretic Generalization Bounds from Supersamples5 Feb 2023
- 2022Limitations of Information-Theoretic Generalization Bounds for Gradient Descent Methods in Stochastic Convex Optimization27 Dec 2022
- 2022Two Facets of SDE Under an Information-Theoretic Lens: Generalization of SGD via Training Trajectories and via Terminal States19 Nov 2022
- 2022Information-Theoretic Analysis of Unsupervised Domain Adaptation3 Oct 2022
- 2022Towards Understanding Sharpness-Aware Minimization13 Jun 2022
- 2022Towards Understanding Sharpness-Aware Minimizationcited by 146
- 2023Enhancing Sharpness-Aware Optimization Through Variance Suppressioncited by 37
- 2023Tighter Information-Theoretic Generalization Bounds from Supersamplescited by 22
- 2024Flat-LoRA: Low-Rank Adaptation over a Flat Loss Landscapecited by 20
- 2022Limitations of Information-Theoretic Generalization Bounds for Gradient Descent Methods in Stochastic Convex Optimizationcited by 19
- 2022Information-Theoretic Analysis of Unsupervised Domain Adaptationcited by 15
- 2023Over-training with Mixup May Hurt Generalizationcited by 13
- 2024Revisiting Random Weight Perturbation for Efficiently Improving Generalizationcited by 13
- 2023Time-Independent Information-Theoretic Generalization Bounds for SGLDcited by 12
- 2022Two Facets of SDE Under an Information-Theoretic Lens: Generalization of SGD via Training Trajectories and via Terminal Statescited by 11
- 2024Information-Theoretic Generalization Bounds for Deep Neural Networkscited by 10
- 2024Implicit Regularization of Sharpness-Aware Minimization for Scale-Invariant Problemscited by 10
12 most cited of 31 All 31 (JSON)
- 2026Information-Theoretic Generalization Bounds for Sequential Decision Making12 May 2026
- 2026Leveraging Flatness to Improve Information-Theoretic Generalization Bounds for SGD4 Jan 2026
- 2025Stable Coresets via Posterior Sampling: Aligning Induced and Full Loss Landscapes21 Nov 2025
- 2025Unveiling m-Sharpness Through the Structure of Stochastic Gradient Noise22 Sep 2025
- 2025VASSO: Variance Suppression for Sharpness-Aware Minimization2 Sep 2025
- 2025Information-Theoretic Generalization Bounds of Replay-based Continual Learning16 Jul 2025
- 2025Tight Generalization Error Bounds for Stochastic Gradient Descent in Non-convex Learning23 Jun 2025
- 2025Fairness Overfitting in Machine Learning: An Information-Theoretic Perspective9 Jun 2025
- 2025Information-theoretic Generalization Analysis for VQ-VAEs: A Role of Latent Variables26 May 2025
- 2024Generalization Bounds via Conditional f-Information30 Oct 2024
- 2024Implicit Regularization of Sharpness-Aware Minimization for Scale-Invariant Problems18 Oct 2024
- 2024Flat-LoRA: Low-Rank Adaptation over a Flat Loss Landscape22 Sep 2024
12 newest of 31 All 31 (JSON)