On the Foundations of Deep Learning: SGD, Overparametrization, and Generalization
summary
Experiment with a 50-neuron teacher and 100-neuron learner shows SGD fails on the well-specified 50-neuron model but hits zero test loss every run after doubling width, so over-parameterization empirically makes optimization easier. Theory proves very wide nets (width M large) keep the Gram/NTK stable so gradient descent converges to an epsilon global minimum; logistic loss dynamics bias towards max‑margin (SVM) solutions; linear deep architectures map L2 weight decay to a Schatten quasi‑norm on the function. Practical caveats: NTK behavior holds for small learning rates and finite‑width/large‑LR models deviate from the kernel regime, so kernel analysis can mispredict state‑of‑the‑art training.
AI-written summary · about
chapters (27)
- 0:00Intro
- 1:32Fundamental Questions
- 1:49Challenges
- 2:32What if the Landscape is Bad?
- 4:58Gradient Descent Finds Global Minima
- 5:47Idea: Study Dynamics of the Prediction
- 7:52Local Geometry
- 8:44Local vs Global Geometry
- 19:49What about Generalization Error?
- 20:32Does Overparametrization Hurt Generalization?
- 21:48Background on Margin Theory
- 22:40Max Margin via Logistic Loss
- 23:32Intuition
- 24:37Overparametrization Improves the Margin
- 25:04Optimization with Regularizer
- 29:06Comparison to NTK
- 31:38Is Regularization Needed?
- 31:54Warmup: Logistic Regression
- 32:54What's Special About Gradient Descent?
- 34:03Changing the Geometry: Steepest Descent
- 34:35Steepest Descent: Examples
- 35:05Beyond Linear Models: Deep Networks
- 36:38Implicit Regularization: NTK vs Asymptotic
- 38:36Does Architecture Matter?
- 39:20Example: Changing the Depth in Linear Network
- 40:24Example: Depth in Linear Convolutional Network
- 41:52Random Thoughts
related talks
01h 14mRecent Developments in Over-parametrized Neural Networks, Part I
01h 14mRecent Developments in Over-parametrized Neural Networks, Part II
01h 37mTutorial: Implicit Bias II
01h 04mNeural Networks meet Nonparametric Regression: Generalization by Weight Decay and Large...
01h 20mThe elusive generalization: classical bounds to double descent to grokking
01h 02mTutorial: Statistical Learning Theory and Neural Networks II
01h 21mTutorial: Implicit Bias I
01h 01mOptimization's Untold Gift to Learning: Implicit Regularization
