Neural Networks meet Nonparametric Regression: Generalization by Weight Decay and Large...
summary
Claims that deep ReLU models, when written as a parallel deep ReLU architecture and reparameterized via AM‑GM, map weight decay to a total variation‑style penalty; with M > n and depth L ~ log n the estimator attains near‑minimax locally adaptive rates. Theory uses a representer‑type argument and comparisons to trend‑filtering; experiments show very overparameterized nets collapse to few active blocks (≈6) and that weight decay tuning (via holdout) is enough, while large learning rate prevents interpolation and biases toward flatter, generalizing solutions.
AI-written summary · about
chapters (10)
- 0:00Introduction
- 1:04Curve fitting and deep learning
- 8:26Nonparametric regression
- 12:57Two-layer ReLU networks
- 16:30Splines and neural networks
- 27:29Parallel networks and adaptivity
- 38:35Experimental results
- 40:22Optimization and learning rate
- 55:58Loss landscape and biases
- 59:59Q&A
related talks
50mLearning and Generalization in Over-parametrized Neural Networks, Going Beyond Kernels
46mOn the Foundations of Deep Learning: SGD, Overparametrization, and Generalization
59mTutorial: Statistical Learning Theory and Neural Networks I
01h 14mRecent Developments in Over-parametrized Neural Networks, Part I
01h 02mTutorial on Deep Learning I
11mOn Implicit Regularization in Deep Learning
46mKernel and Deep Regimes in Overparameterized Learning
01h 14mRecent Developments in Over-parametrized Neural Networks, Part II
