Statistical learning is about the construction and study of systems that can automatically learn from data. With the emergence of massive datasets commonly encountered today, the need for powerful machine learning is of acute importance. Examples of successful applications include effective web search, anti-spam software, computer vision, robotics, practical speech recognition, and a deeper understanding of the human genome.
This course gives an introduction to this exciting field. In the first part, we will introduce basic techniques such as linear regression, logistic regression, multilayer perceptrons, nearest neighbor approaches, both from a theoretical and methodological point of views. In the second part, we will focus on more advanced techniques such as kernel methods, which is a versatile tool to represent data, in combination with (un)supervised learning techniques that are agnostic to the type of data that is learned from. The learning techniques that will be covered include regression, classification, clustering and dimension reduction. We will cover both the theoretical underpinnings of kernels, as well as a series of kernels that are important in practical applications. Finally we will touch upon topics of active research, such as large-scale kernel methods and the use of kernel methods to develop theoretical foundations of deep learning models.
The grading of the class will be done with one final exam.
Addtional exercises (on kernel learning) can be found in this booklet.
The final exam will take place some day in January 2027. It will last 2 hours (the location and precise date is to be confirmed). You are allowed to bring one double-sided single A4 sheet of handwritten notes.
Lectures are scheduled from 2pm to 5pm on Tuesdays. Please bring your laptop as their will sometimes be coding exercises. The first part of the class will recap basic supervised learning techniques, theory, and algorithms. Lecture notes will be continuously updated here, and I'll be looking for motivated volunteers in each session to help write them. A cheat sheet with key formulas and theorems for the course is also available at the end of the lecture notes—feel free to contribute by adding anything you think might be useful for you and your classmates!
You can download the slides for all lectures of the second part of the class (advanced kernel methods) here! Each lecture corresponds to a range of slides. Slides are frequently updated. Please let us know if you spot typos!
| # | Date | Room | Teacher | Topic | |
|---|---|---|---|---|---|
| 1 | 22/09/2026 | H206 | SP | Introduction | |
| 1bis | 22/09/2026 | H206 | SP | Supervised learning basics | |
| 2 | 29/09/2026 | H206 | SP | Linear regression (quizzes) | |
| 2bis | 29/09/2026 | H206 | SP | Linear regression (notebook) | |
| 3 | 06/10/2026 | H206 | SP | Logistic regression (quizzes) | |
| 3bis | 06/10/2026 | H206 | SP | Logistic regression (notebook) | |
| 4 | 13/10/2026 | H206 | SP | Unsupervised learning | |
| 4bis | 13/10/2026 | H206 | SP | Unsupervised learning (notebook) | |
| 5 | 20/10/2026 | H206 | |||
| 5bis | 20/10/2026 | H206 | |||
| 6 | 03/11/2026 | H206 | |||
| 6bis | 03/11/2026 | H206 | |||
| 7 | 10/11/2026 | H206 | |||
| 7bis | 10/11/2026 | H206 | |||
| 8 | 17/11/2026 | H206 | |||
| 8bis | 17/11/2026 | H206 | |||
| 9 | 24/11/2026 | H206 | |||
| 9bis | 24/11/2026 | H206 | |||
| 10 | 01/12/2026 | H201 | |||
| 10bis | 01/12/2026 | H201 | |||
| 11 | 08/01/2027 | H206 | |||
| 11bis | 08/01/2027 | H206 | |||
| 12 | 15/12/2027 | H206 | |||
| 12bis | 15/02/2027 | H206 | |||
| EXAM | TBD | TBD | Final Exam |