# Stanford CS229M: Machine Learning Theory - Fall 2021

Posts from Stanford CS229M: Machine Learning Theory - Fall 2021, via the RSS Amplifier directory.

Page: <https://rssamplifier.com/youtube-com-207>  
Feed: <https://rssamplifier.com/youtube-com-207.md>

---

## [Stanford CS229M - Lecture 16: Implicit regularization in classification problems](https://www.youtube.com/watch?v=mham4hHpo7A)

_2022-11-25 · Stanford Online_

## [Stanford CS229M - Lecture 15: Implicit regularization effect of initialization](https://www.youtube.com/watch?v=l-CR_TLihdg)

_2022-11-24 · Stanford Online_

## [Stanford CS229M - Lecture 14: Neural Tangent Kernel, Implicit regularization of gradient descent](https://www.youtube.com/watch?v=xpT1ymwCk9w)

_2022-11-23 · Stanford Online_

## [Stanford CS229M - Lecture 13: Neural Tangent Kernel](https://www.youtube.com/watch?v=btphvvnad0A)

_2022-11-22 · Stanford Online_

## [Stanford CS229M - Lecture 11: All-layer margin](https://www.youtube.com/watch?v=GeXBfyrKfM4)

_2022-11-21 · Stanford Online_

## [Stanford CS229M - Lecture 10: Generalization bounds for deep nets](https://www.youtube.com/watch?v=P5-VVI1qLxA)

_2022-11-20 · Stanford Online_

## [Stanford CS229M - Lecture 9: Covering number approach, Dudley Theorem](https://www.youtube.com/watch?v=wDfardbL50I)

_2022-11-19 · Stanford Online_

## [Stanford CS229M - Lecture 8: Refined generalization bounds for neural nets, Kernel methods](https://www.youtube.com/watch?v=gwKfeDRCvSg)

_2022-11-18 · Stanford Online_

## [Stanford CS229M - Lecture 7: Challenges in DL theory, generalization bounds for neural nets](https://www.youtube.com/watch?v=kVkMRDZ5fcU)

_2022-11-17 · Stanford Online_

## [Stanford CS229M - Lecture 6: Margin theory and Rademacher complexity for linear models](https://www.youtube.com/watch?v=echF7IWE05c)

_2022-11-16 · Stanford Online_

## [Marketplace for AI-Powered Professionals (Sponsored)](https://crawlproof.com/a/vx4r3sHjePid)

_2022-11-16 · **Sponsored**_

Find professionals who use ChatGPT, Copilot, and Claude to deliver work faster.

## [Stanford CS229M - Lecture 5: Rademacher complexity, empirical Rademacher complexity](https://www.youtube.com/watch?v=tkJd2B98hII)

_2022-11-15 · Stanford Online_

## [Stanford CS229M - Lecture 4: Advanced concentration inequalities](https://www.youtube.com/watch?v=fKM6fcOkXuk)

_2022-11-14 · Stanford Online_

## [Stanford CS229M - Lecture 3: Finite hypothesis class, discretizing infinite hypothesis space](https://www.youtube.com/watch?v=io-YFfXbIXk)

_2022-11-13 · Stanford Online_

## [Stanford CS229M - Lecture 2: Asymptotic analysis, uniform convergence, Hoeffding inequality](https://www.youtube.com/watch?v=Fx3xldCEfsM)

_2022-11-12 · Stanford Online_

## [Stanford CS229M - Lecture 1: Overview, supervised learning, empirical risk minimization](https://www.youtube.com/watch?v=I-tmjGFaaBg)

_2022-11-11 · Stanford Online_