Weight Expansion: A New Perspective on Dropout and Generalization
Not on the map. Why?
Abstract (arXiv)
While dropout is known to be a successful regularization technique, insights into the mechanisms that lead to this success are still lacking. We introduce the concept of weight expansion, an increase in the signed volume of a parallelotope spanned by the column or row vectors of the weight covariance matrix, and show that weight expansion is an effective means of increasing the generalization in a PAC-Bayesian setting. We provide a theoretical argument that dropout leads to weight expansion and extensive empirical support for the correlation between dropout and weight expansion. To support our hypothesis that weight expansion can be regarded as an indicator of the enhanced generalization capability endowed by dropout, and not just as a mere by-product, we have studied other methods that achieve weight expansion (resp. contraction), and found that they generally lead to an increased (resp. decreased) generalization ability. This suggests that dropout is an attractive regularizer, because it is a computationally cheap method for obtaining weight expansion. This insight justifies the role of dropout as a regularizer, while paving the way for identifying regularizers that promise improved generalization through weight expansion.
Key facts. Cited by 6 papers in the map (data through 7 Oct 2026). Builds on 73 of its 116 references that are in the map. First posted on arXiv 23 Jan 2022.
Builds on
73 of 116 references.
References · 73
- 2014Very Deep Convolutional Networks for Large-Scale Image Recognitioncited by 15,267
- 2015Dropout as a Bayesian Approximation: Representing Model Uncertainty in Deep Learningcited by 4,416
- 2016Enriching Word Vectors with Subword Informationcited by 1,578
- 2020Sharpness-Aware Minimization for Efficiently Improving Generalizationcited by 1,404
- 2016On Large-Batch Training for Deep Learning: Generalization Gap and Sharp Minimacited by 1,337
- 2014Convolutional Neural Networks for Sentence Classificationcited by 1,124
- 2016Bag of Tricks for Efficient Text Classificationcited by 869
- 2015Optimizing Neural Networks with Kronecker-factored Approximate Curvaturecited by 776
- 2013Exact solutions to the nonlinear dynamics of learning in deep linear neural networkscited by 748
- 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
- 2019Fantastic Generalization Measures and Where to Find Themcited by 507
38 more
- 2015Variational Dropout and the Local Reparameterization Trickcited by 489
- 2017Sharp Minima Can Generalize For Deep Netscited by 462
- 2019Reducing Transformer Depth on Demand with Structured Dropoutcited by 434
- 2019Implicit Regularization in Deep Matrix Factorizationcited by 402
- 2016Entropy-SGD: Biasing Gradient Descent Into Wide Valleyscited by 357
- 2016FastText.zip: Compressing text classification modelscited by 331
- 2017A PAC-Bayesian Approach to Spectrally-Normalized Margin Bounds for Neural Networkscited by 309
- 2015Norm-Based Capacity Control in Neural Networkscited by 299
- 2017Information-theoretic analysis of generalization capability of learning algorithmscited by 299
- 2017Three Factors Influencing Minima in SGDcited by 270
- 2017Concrete Dropoutcited by 227
- 2017Spectral Norm Regularization for Improving the Generalizability of Deep Learningcited by 178
- 2019Towards Explaining the Regularization Effect of Initial Large Learning Rate in Training Neural Networkscited by 162
- 2016Recurrent Neural Network for Text Classification with Multi-Task Learningcited by 144
- 2018Towards Understanding the Role of Over-Parametrization in Generalization of Neural Networkscited by 140
- 2017Practical Gauss-Newton Optimisation for Deep Learningcited by 139
- 2017A Bayesian Perspective on Generalization and Stochastic Gradient Descentcited by 134
- 2016Information Dropout: Learning Optimal Representations Through Noisy Computationcited by 131
- 2015All you need is a good initcited by 124
- 2015On the properties of variational approximations of Gibbs posteriorscited by 121
- 2017Improving Generalization Performance by Switching from Adam to SGDcited by 121
- 2019Information-Theoretic Generalization Bounds for SGLD via Data-Dependent Estimatescited by 118
- 2015Path-SGD: Path-Normalized Optimization in Deep Neural Networkscited by 117
- 2020Tighter risk certificates for neural networkscited by 112
- 2017Stochastic gradient descent performs variational inference, converges to limit cycles for deep networkscited by 108
- 2020Rethinking Bias-Variance Trade-off for Generalization of Neural Networkscited by 107
- 2014Preserving Statistical Validity in Adaptive Data Analysiscited by 102
- 2017Fisher-Rao Metric, Geometry, and Complexity of Neural Networkscited by 99
- 2020Normalization Techniques in Training DNNs: Methodology, Analysis and Applicationcited by 90
- 2013Dropout Training as Adaptive Regularizationcited by 89
- 2020Sharpened Generalization Bounds based on Conditional Mutual Information and an Application to Noisy, Iterative Algorithmscited by 89
- 2018Hessian-based Analysis of Large Batch Training and Robustness to Adversariescited by 87
- 2018On the Relation Between the Sharpest Directions of DNN Loss and the SGD Step Lengthcited by 85
- 2017Entropy-SGD optimizes the prior of a PAC-Bayes bound: Generalization properties of Entropy-SGD and data-dependent priorscited by 81
- 2020In Search of Robust Measures of Generalizationcited by 79
- 2015Generalization in Adaptive Data Analysis and Holdout Reusecited by 76
- 2018A Walk with SGDcited by 74
- 2020The Implicit and Explicit Regularization Effects of Dropoutcited by 71
50 most cited of 73 All 73 (JSON)
Built on by
Citing papers per year: 2022: 1; 2023: 1; 2024: 1; 2025: 1; 2026: 2.
6 papers.
- 2022Enhancing Adversarial Training with Second-Order Statistics of Weightscited by 42
- 2025Enhancing Robust Fairness via Confusional Spectral Regularizationcited by 11
- 2023Optimising Event-Driven Spiking Neural Network with Regularisation and Cutoffcited by 8
- 2024Singular-limit analysis of gradient descent with noise injectioncited by 5
- 2026Towards A Unified PAC-Bayesian Framework for Norm-based Generalization Boundscited by 4
- 2026Margin-Adaptive Confidence Ranking for Reliable LLM Judgementcited by 1
- 2026Margin-Adaptive Confidence Ranking for Reliable LLM Judgement14 May 2026
- 2026Towards A Unified PAC-Bayesian Framework for Norm-based Generalization Bounds13 Jan 2026
- 2025Enhancing Robust Fairness via Confusional Spectral Regularization22 Jan 2025
- 2024Singular-limit analysis of gradient descent with noise injection18 Apr 2024
- 2023Optimising Event-Driven Spiking Neural Network with Regularisation and Cutoff23 Jan 2023
- 2022Enhancing Adversarial Training with Second-Order Statistics of Weights11 Mar 2022