Experiments with Rich Regime Training for Deep Learning
Not on the map. Why?
Abstract (arXiv)
In spite of advances in understanding lazy training, recent work attributes the practical success of deep learning to the rich regime with complex inductive bias. In this paper, we study rich regime training empirically with benchmark datasets, and find that while most parameters are lazy, there is always a small number of active parameters which change quite a bit during training. We show that re-initializing (resetting to their initial random values) the active parameters leads to worse generalization. Further, we show that most of the active parameters are in the bottom layers, close to the input, especially as the networks become wider. Based on such observations, we study static Layer-Wise Sparse (LWS) SGD, which only updates some subsets of layers. We find that only updating the top and bottom layers have good generalization and, as expected, only updating the top layers yields a fast algorithm. Inspired by this, we investigate probabilistic LWS-SGD, which mostly updates the top layers and occasionally updates the full network. We show that probabilistic LWS-SGD matches the generalization performance of vanilla SGD and the back-propagation time can be 2-5 times more efficient.
Key facts. Cited by 2 papers in the map (data through 14 Oct 2026). Builds on 44 of its 60 references that are in the map. First posted on arXiv 26 Feb 2021.
Builds on
44 of 60 references.
References · 44
- 2017Attention Is All You Needcited by 60,361
- 2015Deep Residual Learning for Image Recognitioncited by 52,096
- 2014Very Deep Convolutional Networks for Large-Scale Image Recognitioncited by 15,364
- 2014ImageNet Large Scale Visual Recognition Challengecited by 8,498
- 2017Fashion-MNIST: a Novel Image Dataset for Benchmarking Machine Learning Algorithmscited by 4,349
- 2014Going Deeper with Convolutionscited by 4,241
- 2014Sequence to Sequence Learning with Neural Networkscited by 2,986
- 2018Neural Tangent Kernel: Convergence and Generalization in Neural Networkscited by 2,621
- 2016WaveNet: A Generative Model for Raw Audiocited by 1,722
- 2016Google's Neural Machine Translation System: Bridging the Gap between Human and Machine Translationcited by 1,475
- 2016Deep Networks with Stochastic Depthcited by 979
- 2018A Convergence Theory for Deep Learning via Over-Parameterizationcited by 787
32 more
- 2019Wide Neural Networks of Any Depth Evolve as Linear Models Under Gradient Descentcited by 738
- 2018On Lazy Training in Differentiable Programmingcited by 675
- 2018Gradient Descent Provably Optimizes Over-parameterized Neural Networkscited by 659
- 2018Gradient Descent Finds Global Minima of Deep Neural Networkscited by 574
- 2019On Exact Computation with an Infinitely Wide Neural Netcited by 573
- 2019Fine-Grained Analysis of Optimization and Generalization for Overparameterized Two-Layer Neural Networkscited by 566
- 2018A Mean Field View of the Landscape of Two-Layers Neural Networkscited by 466
- 2015Deep Speech 2: End-to-End Speech Recognition in English and Mandarincited by 451
- 2019Implicit Regularization in Deep Matrix Factorizationcited by 405
- 2018Sparsified SGD with Memorycited by 376
- 2017Implicit Regularization in Matrix Factorizationcited by 322
- 2020Implicit Bias of Gradient Descent for Wide Two-layer Neural Networks Trained with the Logistic Losscited by 268
- 2018Learning Overparameterized Neural Networks via Stochastic Gradient Descent on Structured Datacited by 261
- 2018Implicit Bias of Gradient Descent on Linear Convolutional Networkscited by 251
- 2017Sparse Communication for Distributed Gradient Descentcited by 249
- 2018The Convergence of Sparsified Gradient Methodscited by 229
- 2018Gradient Descent Happens in a Tiny Subspacecited by 217
- 2019Mean-field theory of two-layers neural networks: dimension-free bounds and kernel limitcited by 187
- 2020Deep learning versus kernel learning: an empirical study of loss landscape geometry and the time evolution of the Neural Tangent Kernelcited by 187
- 2019Scaling Limits of Wide Neural Networks with Weight Sharing: Gaussian Process Behavior, Gradient Independence, and Neural Tangent Kernel Derivationcited by 149
- 2018Stochastic Gradient Descent Optimizes Over-parameterized Deep ReLU Networkscited by 141
- 2019Polylogarithmic width suffices for gradient descent to achieve arbitrarily small test error with shallow ReLU networkscited by 121
- 2020Implicit Regularization in Deep Learning May Not Be Explainable by Normscited by 119
- 2019How do infinite width bounded norm networks look in function space?cited by 106
- 2019Are All Layers Created Equal?cited by 94
- 2020Bypassing the Ambient Dimension: Private SGD with Gradient Subspace Identificationcited by 90
- 2019How Much Over-parameterization Is Sufficient to Learn Deep ReLU Networks?cited by 84
- 2020Implicit Bias in Deep Linear Classification: Initialization Scale vs Training Accuracycited by 71
- 2020The Recurrent Neural Tangent Kernelcited by 67
- 2020Why Do Deep Residual Networks Generalize Better than Deep Feedforward Networks? -- A Neural Tangent Kernel Perspectivecited by 60
- 2019LCA: Loss Change Allocation for Neural Network Trainingcited by 9
- 2018Channel selection using Gumbel Softmaxcited by 1
Built on by
Citing papers per year: 2024: 2.
2 papers.