Statistical learning theory — различия между версиями
Материал из Wiki - Факультет компьютерных наук
Bbauwens (обсуждение | вклад) м |
Bbauwens (обсуждение | вклад) м (scedule) |
||
Строка 16: | Строка 16: | ||
|- | |- | ||
| 12 sept || PAC-learning and VC-dimension: proof of fundamental theorem || || [https://www.dropbox.com/s/wczt02f8linttzu/2seminar.pdf?dl=0 Problem list 2] | | 12 sept || PAC-learning and VC-dimension: proof of fundamental theorem || || [https://www.dropbox.com/s/wczt02f8linttzu/2seminar.pdf?dl=0 Problem list 2] | ||
+ | |||
+ | |||
+ | |- | ||
+ | | 19 sept || Sauer's lemma, agnostic PAC-learning, structural risk minimization || || | ||
+ | |||
+ | |- | ||
+ | | 26 sept || Computational learning theory || || | ||
+ | |||
+ | |||
+ | |- | ||
+ | | 3 okt || Boosting: the adaBoost algorithm || || | ||
+ | |||
+ | |- | ||
+ | | 10 okt || Boosting: several other algorithms || || | ||
+ | |||
+ | |- | ||
+ | | 17 okt || Online learning algorithms || || | ||
+ | |||
+ | |||
|- | |- | ||
|} | |} |
Версия 18:53, 13 сентября 2017
General Information
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, agnostic PAC-learning, structural risk minimization | ||
26 sept | Computational learning theory |
| |
3 okt | Boosting: the adaBoost algorithm | ||
10 okt | Boosting: several other algorithms | ||
17 okt | Online learning algorithms |
|
Office hours
Person | Monday | Tuesday | Wednesday | Thursday | Friday | ||
---|---|---|---|---|---|---|---|
|
Bruno Bauwens | 15:05–18:00 | 15:05–18:00 | Room 620 | |||
|
Quentin Paris |