Optimization's Untold Gift to Learning: Implicit Regularization
summary
Shows that plain optimization picks a particular solution from many global minima: gradient methods on underdetermined linear least squares converge to the minimum-norm solution; gradient flow on factorized matrix models empirically and conjecturally selects the minimum nuclear-norm completion if initialized near zero with tiny steps (proven when measurements commute); for separable logistic loss gradient descent diverges in norm but converges in direction to the maximum-margin direction with WT ≈ w_mm · log T and margin improving only as 1/log T. Experiments show Path-SGD and SGD/Adam produce different generalization, so implicit bias depends on optimizer.
AI-written summary · about
chapters (18)
- 0:00Intro
- 2:53Increasing the Network Size (Number of Hidden Units)
- 6:52AdaBoost
- 11:40The Path-Norm
- 16:36Where is the Regularization?
- 21:07SGD vs ADAM
- 23:52Different optimization algorithm
- 27:06Simple Example: Least Squares
- 28:25Moving On: Matrix Least Squares
- 29:29Factorized Matrix Problems (Linear Neural Nets)
- 38:50Warm Up: Gradient Descent on W
- 41:07GD on U, single observation (m=1)
- 44:41What we can prove: commutative A
- 46:31The Non-Commutative Case
- 50:30Logistic Regression on Separable Data
- 54:10How Fast is the Margin Maximized?
- 57:59Other Objectives and Opt Methods
- 59:14Different Asymptotics
related talks
01h 23mImplicit Regularization II
01h 17mImplicit Regularization I
11mOn Implicit Regularization in Deep Learning
01h 05mOptimization for Machine Learning I
46mAnalyzing Optimization and Generalization in Deep Learning via Trajectories of Gradient Descent
01h 04mOptimization for Machine Learning II
46mKernel and Deep Regimes in Overparameterized Learning
47mIs Minimax Optimization the Right Framework to Understand Learning in Minimax Games?
