If f(x) has at most six zero crossings, we can find at most degree six polynomial that agrees with its sign. (Image by Prof. Ankur Moitra.)
Instructor(s)
Prof. Ankur Moitra
MIT Course Number
18.409
As Taught In
Spring 2015
Level
Graduate
Course Description
Course Features
- Lecture notes
- Assignments: problem sets (no solutions)
- Assignments: activity (no examples)
- Assignments: written (no examples)
Course Description
This course is organized around algorithmic issues that arise in machine learning. Modern machine learning systems are often built on top of algorithms that do not have provable guarantees, and it is the subject of debate when and why they work. In this class, we focus on designing algorithms whose performance we can rigorously analyze for fundamental machine learning problems.