RSS Amplifier

Video feed

Stanford CS229M: Machine Learning Theory - Fall 2021

youtube.comSource feed ↗15 videos

Dormant Last read · last published · next check
Read 2 days ago and current, but nothing has been published for 4 years.

Written by

Latest videos

Saves to your Watch queue, to pick up on another day or another device.

Stanford CS229M - Lecture 16: Implicit regularization in classification problems

Play

Stanford CS229M - Lecture 15: Implicit regularization effect of initialization

Play

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

Play

Stanford CS229M - Lecture 13: Neural Tangent Kernel

Play

Stanford CS229M - Lecture 11: All-layer margin

Play

Stanford CS229M - Lecture 10: Generalization bounds for deep nets

Play

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

Play

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

Play

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

Play

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

Play

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

Play

Stanford CS229M - Lecture 4: Advanced concentration inequalities

Play

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

Play

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

Play

Stanford CS229M - Lecture 1: Overview, supervised learning, empirical risk minimization

Play