
Stanford CS229M: Machine Learning Theory - Fall 2021
Dormant Last read · last published · next check
Read 2 days ago and current, but nothing has been published for 4 years.
Latest videos
Saves to your Watch queue, to pick up on another day or another device.


Stanford CS229M - Lecture 15: Implicit regularization effect of initialization

Stanford CS229M - Lecture 14: Neural Tangent Kernel, Implicit regularization of gradient descent

Stanford CS229M - Lecture 13: Neural Tangent Kernel

Stanford CS229M - Lecture 11: All-layer margin

Stanford CS229M - Lecture 10: Generalization bounds for deep nets

Stanford CS229M - Lecture 9: Covering number approach, Dudley Theorem

Stanford CS229M - Lecture 8: Refined generalization bounds for neural nets, Kernel methods

Stanford CS229M - Lecture 7: Challenges in DL theory, generalization bounds for neural nets

Stanford CS229M - Lecture 6: Margin theory and Rademacher complexity for linear models

Stanford CS229M - Lecture 5: Rademacher complexity, empirical Rademacher complexity

Stanford CS229M - Lecture 4: Advanced concentration inequalities

Stanford CS229M - Lecture 3: Finite hypothesis class, discretizing infinite hypothesis space

Stanford CS229M - Lecture 2: Asymptotic analysis, uniform convergence, Hoeffding inequality

