Implicit Regularization Paths of Weighted Neural Representations
Not on the map. Why?
Abstract (arXiv)
We study the implicit regularization effects induced by (observation) weighting of pretrained features. For weight and feature matrices of bounded operator norms that are infinitesimally free with respect to (normalized) trace functionals, we derive equivalence paths connecting different weighting matrices and ridge regularization levels. Specifically, we show that ridge estimators trained on weighted features along the same path are asymptotically equivalent when evaluated against test vectors of bounded norms. These paths can be interpreted as matching the effective degrees of freedom of ridge estimators fitted with weighted features. For the special case of subsampling without replacement, our results apply to independently sampled random features and kernel features and confirm recent conjectures (Conjectures 7 and 8) of the authors on the existence of such paths in Patil et al. We also present an additive risk decomposition for ensembles of weighted estimators and show that the risks are equivalent along the paths when the ensemble size goes to infinity. As a practical consequence of the path equivalences, we develop an efficient cross-validation method for tuning and apply it to subsampled pretrained representations across several models (e.g., ResNet-50) and datasets (e.g., CIFAR-100).
Key facts. Cited by 1 paper in the map (data through 7 Oct 2026). Builds on 49 of its 82 references that are in the map. First posted on arXiv 28 Aug 2024.
Builds on
49 of 82 references.
References · 49
- 2015Deep Residual Learning for Image Recognitioncited by 51,809
- 2017Fashion-MNIST: a Novel Image Dataset for Benchmarking Machine Learning Algorithmscited by 4,283
- 2015Delving Deep into Rectifiers: Surpassing Human-Level Performance on ImageNet Classificationcited by 3,590
- 2018Neural Tangent Kernel: Convergence and Generalization in Neural Networkscited by 2,597
- 2016Understanding deep learning requires rethinking generalizationcited by 1,657
- 2014How transferable are features in deep neural networks?cited by 1,216
- 2019Benign Overfitting in Linear Regressioncited by 544
- 2019Surprises in High-Dimensional Ridgeless Least Squares Interpolationcited by 508
- 2019The generalization error of random features regression: Precise asymptotics and double descent curvecited by 410
- 2021Explaining Neural Scaling Lawscited by 353
- 2021Deep learning: a statistical viewpointcited by 239
- 2020Spectrum Dependent Learning Curves in Kernel Regression and Wide Neural Networkscited by 200
37 more
- 2019Two models of double descent for weak featurescited by 194
- 2018Just Interpolate: Kernel "Ridgeless" Regression Can Generalizecited by 190
- 2020When Do Neural Networks Outperform Kernel Methods?cited by 150
- 2015High-Dimensional Asymptotics of Prediction: Ridge Regression and Classificationcited by 146
- 2019Scaling Limits of Wide Neural Networks with Weight Sharing: Gaussian Process Behavior, Gradient Independence, and Neural Tangent Kernel Derivationcited by 146
- 2021Learning curves of generic features maps for realistic datasets with a teacher-student modelcited by 126
- 2020Optimal Regularization Can Mitigate Double Descentcited by 107
- 2020The Neural Tangent Kernel in High Dimensions: Triple Descent and a Multi-Scale Theory of Generalizationcited by 101
- 2021Generalization Error Rates in Kernel Regression: The Crossover from the Noiseless to Noisy Regimecited by 95
- 2013Dropout Training as Adaptive Regularizationcited by 89
- 2022More Than a Toy: Random Matrix Models Predict How Real-World Neural Representations Generalizecited by 87
- 2018A Continuous-Time View of Early Stopping for Least Squarescited by 67
- 2020The Implicit Regularization of Stochastic Gradient Flow for Least Squarescited by 58
- 2020Kernel Alignment Risk Estimator: Risk Prediction from Training Datacited by 54
- 2021Uniform Convergence of Interpolators: Gaussian Width, Norm Bounds, and Benign Overfittingcited by 54
- 2023High-dimensional analysis of double descent for linear regression with random projectionscited by 47
- 2022Benign, Tempered, or Catastrophic: A Taxonomy of Overfittingcited by 36
- 2021Hessian Eigenspectra of More Realistic Nonlinear Modelscited by 33
- 2018Iterate averaging as regularization for stochastic gradient descentcited by 27
- 2019The Implicit Regularization of Ordinary Least Squares Ensemblescited by 25
- 2018Distributed linear regression by averagingcited by 21
- 2019A Random Matrix Perspective on Mixtures of Nonlinearities for Deep Learningcited by 20
- 2024Optimal Ridge Regularization for Out-of-Distribution Predictioncited by 18
- 2019Ridge Regression: Structure, Cross-Validation, and Sketchingcited by 15
- 2023Demystifying Disagreement-on-the-Line in High Dimensionscited by 12
- 2022Bagging in overparameterized learning: Risk characterization and risk monotonizationcited by 11
- 2023Subsample Ridge Ensembles: Equivalences and Generalized Cross-Validationcited by 11
- 2023Asymptotically free sketched ridge ensembles: Risks, cross-validation, and tuningcited by 11
- 2023Generalized equivalences between subsampling and ridge regularizationcited by 10
- 2022Mitigating multiple descents: A model-agnostic framework for risk monotonizationcited by 9
- 2022Asymptotics of the Sketched Pseudoinversecited by 9
- 2022Kernel Methods and Multi-layer Perceptrons Learn Linear Models in High Dimensionscited by 8
- 2023Sketched Ridgeless Linear Regression: The Role of Downsamplingcited by 7
- 2021The Flip Side of the Reweighted Coin: Duality of Adaptive Dropout and Regularizationcited by 6
- 2023Corrected generalized cross-validation for finite ensembles of penalized estimatorscited by 5
- 2023Extrapolated cross-validation for randomized ensemblescited by 4
- 2024Analysis of Bootstrap and Subsampling in High-dimensional Regularized Regressioncited by 4
Built on by
Citing papers per year: 2026: 1.
1 paper.