Lecture
Mediaspace scheduled maintenance: Aug 25, 2026 07:00 - 12:00 AM. During this time, videos will be temporarily unavailable. Check status updates.
This lecture covers learning bounds for the misclassification error, Rademacher complexities for binary classifiers, Massart's lemma, growth function, shattering, and Vapnik-Chervonenkis dimension. It also includes examples with linear classifiers and rectangles, Sauer's lemma, polynomial upper bound, and learning bound based on VC dimension.