Lecture 5: Agnostic Learning and Complexity

Part 2 · PAC Learning Framework

Lecture: Monday, October 12, 2026

Topics

• Agnostic PAC learning and uniform convergence
• Fundamental theorem of statistical learning
• Rademacher complexity, ghost samples, and symmetrization
• Structural risk minimization

Materials

• 📄 Learning Sheet
• 📝 Lecture 5 Validation — Questions
• 📖 Lecture 5 Validation — With Solutions
• 📋 Cheatsheet

Next class: Part 2 Test

The Part 2 Test covers Lectures 3–5, is worth 120 marks, and lasts 30 minutes. It contributes 14% of the course grade.

← Previous Lecture · Next Lecture →