mlsanityData to 7 Oct 2026

Weight Expansion: A New Perspective on Dropout and Generalization

arXiv 2201.09209 ↗First posted 23 Jan 2022cs.LG stat.MLcited by 6

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

  1. 2014Very Deep Convolutional Networks for Large-Scale Image Recognitioncited by 15,267
  2. 2015Dropout as a Bayesian Approximation: Representing Model Uncertainty in Deep Learningcited by 4,416
  3. 2016Enriching Word Vectors with Subword Informationcited by 1,578
  4. 2020Sharpness-Aware Minimization for Efficiently Improving Generalizationcited by 1,404
  5. 2016On Large-Batch Training for Deep Learning: Generalization Gap and Sharp Minimacited by 1,337
  6. 2014Convolutional Neural Networks for Sentence Classificationcited by 1,124
  7. 2016Bag of Tricks for Efficient Text Classificationcited by 869
  8. 2015Optimizing Neural Networks with Kronecker-factored Approximate Curvaturecited by 776
  9. 2013Exact solutions to the nonlinear dynamics of learning in deep linear neural networkscited by 748
  10. 2017Exploring Generalization in Deep Learningcited by 595
  11. 2017Computing Nonvacuous Generalization Bounds for Deep (Stochastic) Neural Networks with Many More Parameters than Training Datacited by 527
  12. 2019Fantastic Generalization Measures and Where to Find Themcited by 507
38 more
  1. 2015Variational Dropout and the Local Reparameterization Trickcited by 489
  2. 2017Sharp Minima Can Generalize For Deep Netscited by 462
  3. 2019Reducing Transformer Depth on Demand with Structured Dropoutcited by 434
  4. 2019Implicit Regularization in Deep Matrix Factorizationcited by 402
  5. 2016Entropy-SGD: Biasing Gradient Descent Into Wide Valleyscited by 357
  6. 2016FastText.zip: Compressing text classification modelscited by 331
  7. 2017A PAC-Bayesian Approach to Spectrally-Normalized Margin Bounds for Neural Networkscited by 309
  8. 2015Norm-Based Capacity Control in Neural Networkscited by 299
  9. 2017Information-theoretic analysis of generalization capability of learning algorithmscited by 299
  10. 2017Three Factors Influencing Minima in SGDcited by 270
  11. 2017Concrete Dropoutcited by 227
  12. 2017Spectral Norm Regularization for Improving the Generalizability of Deep Learningcited by 178
  13. 2019Towards Explaining the Regularization Effect of Initial Large Learning Rate in Training Neural Networkscited by 162
  14. 2016Recurrent Neural Network for Text Classification with Multi-Task Learningcited by 144
  15. 2018Towards Understanding the Role of Over-Parametrization in Generalization of Neural Networkscited by 140
  16. 2017Practical Gauss-Newton Optimisation for Deep Learningcited by 139
  17. 2017A Bayesian Perspective on Generalization and Stochastic Gradient Descentcited by 134
  18. 2016Information Dropout: Learning Optimal Representations Through Noisy Computationcited by 131
  19. 2015All you need is a good initcited by 124
  20. 2015On the properties of variational approximations of Gibbs posteriorscited by 121
  21. 2017Improving Generalization Performance by Switching from Adam to SGDcited by 121
  22. 2019Information-Theoretic Generalization Bounds for SGLD via Data-Dependent Estimatescited by 118
  23. 2015Path-SGD: Path-Normalized Optimization in Deep Neural Networkscited by 117
  24. 2020Tighter risk certificates for neural networkscited by 112
  25. 2017Stochastic gradient descent performs variational inference, converges to limit cycles for deep networkscited by 108
  26. 2020Rethinking Bias-Variance Trade-off for Generalization of Neural Networkscited by 107
  27. 2014Preserving Statistical Validity in Adaptive Data Analysiscited by 102
  28. 2017Fisher-Rao Metric, Geometry, and Complexity of Neural Networkscited by 99
  29. 2020Normalization Techniques in Training DNNs: Methodology, Analysis and Applicationcited by 90
  30. 2013Dropout Training as Adaptive Regularizationcited by 89
  31. 2020Sharpened Generalization Bounds based on Conditional Mutual Information and an Application to Noisy, Iterative Algorithmscited by 89
  32. 2018Hessian-based Analysis of Large Batch Training and Robustness to Adversariescited by 87
  33. 2018On the Relation Between the Sharpest Directions of DNN Loss and the SGD Step Lengthcited by 85
  34. 2017Entropy-SGD optimizes the prior of a PAC-Bayes bound: Generalization properties of Entropy-SGD and data-dependent priorscited by 81
  35. 2020In Search of Robust Measures of Generalizationcited by 79
  36. 2015Generalization in Adaptive Data Analysis and Holdout Reusecited by 76
  37. 2018A Walk with SGDcited by 74
  38. 2020The Implicit and Explicit Regularization Effects of Dropoutcited by 71

50 most cited of 73 All 73 (JSON)

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2022: 1; 2023: 1; 2024: 1; 2025: 1; 2026: 2.

6 papers.