cs229m

Pick anything below and it plays in the bar at the foot of the window — and keeps playing while you go on browsing the directory.

1. 1▶Stanford CS229M - Lecture 16: Implicit regularization in classification problemsStanford CS229M: Machine Learning Theory - Fall 2021Notes
   +Watch later
2. 2▶Stanford CS229M - Lecture 15: Implicit regularization effect of initializationStanford CS229M: Machine Learning Theory - Fall 2021Notes
   +Watch later
3. 3▶Stanford CS229M - Lecture 14: Neural Tangent Kernel, Implicit regularization of gradient descentStanford CS229M: Machine Learning Theory - Fall 2021Notes
   +Watch later
4. 4▶Stanford CS229M - Lecture 13: Neural Tangent KernelStanford CS229M: Machine Learning Theory - Fall 2021Notes
   +Watch later
5. 5▶Stanford CS229M - Lecture 11: All-layer marginStanford CS229M: Machine Learning Theory - Fall 2021Notes
   +Watch later
6. 6▶Stanford CS229M - Lecture 10: Generalization bounds for deep netsStanford CS229M: Machine Learning Theory - Fall 2021Notes
   +Watch later
7. 7▶Stanford CS229M - Lecture 9: Covering number approach, Dudley TheoremStanford CS229M: Machine Learning Theory - Fall 2021Notes
   +Watch later
8. 8▶Stanford CS229M - Lecture 8: Refined generalization bounds for neural nets, Kernel methodsStanford CS229M: Machine Learning Theory - Fall 2021Notes
   +Watch later
9. 9▶Stanford CS229M - Lecture 7: Challenges in DL theory, generalization bounds for neural netsStanford CS229M: Machine Learning Theory - Fall 2021Notes
   +Watch later
10. 10▶Stanford CS229M - Lecture 6: Margin theory and Rademacher complexity for linear modelsStanford CS229M: Machine Learning Theory - Fall 2021Notes
    +Watch later
11. 11▶Stanford CS229M - Lecture 5: Rademacher complexity, empirical Rademacher complexityStanford CS229M: Machine Learning Theory - Fall 2021Notes
    +Watch later
12. 12▶Stanford CS229M - Lecture 4: Advanced concentration inequalitiesStanford CS229M: Machine Learning Theory - Fall 2021Notes
    +Watch later
13. 13▶Stanford CS229M - Lecture 3: Finite hypothesis class, discretizing infinite hypothesis spaceStanford CS229M: Machine Learning Theory - Fall 2021Notes
    +Watch later
14. 14▶Stanford CS229M - Lecture 2: Asymptotic analysis, uniform convergence, Hoeffding inequalityStanford CS229M: Machine Learning Theory - Fall 2021Notes
    +Watch later
15. 15▶Stanford CS229M - Lecture 1: Overview, supervised learning, empirical risk minimizationStanford CS229M: Machine Learning Theory - Fall 2021Notes
    +Watch later