Statistical learning theory

Материал из Wiki - Факультет компьютерных наук
Перейти к: навигация, поиск

General Information

Syllabus for the 1st module

The intermediate exam will happen on Tuesday Okt. 31 for exercises and the colloquium (for theory questions) will be in smaller groups around this date.


Homework module 1 (1 okt: corrected a typo in question 2b.) The deadline for submission is Sunday 15th of Oktober (3 day extension upon request). Submit either by email, in paper during the lecture, or place it under the door of office 620.

Additional clarifications based on questions of the students. Defenses of the homework will happen from 13th of Okt. till 20 Okt.


Will be placed here. The deadline for submission is Saturday 21th of Okt.

Course materials

Date Summary Lecture notes Problem list
5 sept PAC-learning and VC-dimension: definitions 1st and 2nd lecture Updated on 13th of Sept. Problem list 1
12 sept PAC-learning and VC-dimension: proof of fundamental theorem Problem list 2
19 sept Sauer's lemma, neural networks and agnostic PAC-learning 3th lecture Updated on the 23th of Sept. Problem list 3
26 sept Measure concentration, agnostic PAC-learning and Computational learning theory 4th lecture Problem list 4
3 okt Boosting: the adaBoost algorithm 5th lecture (part about agnostic learning) Problem list 5
10 okt Boosting: several other algorithms
17 okt Online learning algorithms

A gentle introduction to the materials of the first 3 lectures and an overview of probability theory, can be found in chapters 1-6 and 11-12 of the following book: Sanjeev Kulkarni and Gilbert Harman: An Elementary Introduction to Statistical Learning Theory, 2012.

Office hours

Person Monday Tuesday Wednesday Thursday Friday
Bruno Bauwens 15:05–18:00 15:05–18:00 Room 620
Quentin Paris