18.657
Topics in Statistics
Topics vary from term to term.
Fall 2015 · Mathematics of Machine Learning
Topics
- Introduction
- Binary Classification
- Concentration Inequalities
- Fast Rates and VC Theory
- The VC Inequality
- Covering Numbers
- Chaining
- Convexification
- Boosting
- Support Vector Machines
- Gradient Descent
- Projected Gradient Descent
- Mirror Descent
- Stochastic Gradient Descent
- Prediction with Expert Advice
- Follow the Perturbed Leader
- Online Learning with Structured Experts
- Stochastic Bandits
- Prediction of Individual Sequences
- Adversarial Bandits
- Linear Bandits
- Blackwell’s Approachability
- Potential Based Approachability
- Final Project Presentation
Prerequisites & course information
Prereq: Permission of instructor Acad Year 2027-2028: Not offered Acad Year 2028-2029: G (Fall) 3-0-9 units Can be repeated for credit.
Sources
- Course catalogue ↗2026–2027
- MIT OpenCourseWare ↗Fall 2015
- MIT OCW readings ↗
- MIT OCW syllabus ↗
- MIT OCW calendar ↗
- Historical MIT OpenCourseWare offering. Named reading entries and schedule topics are automatically extracted from the linked source pages.