Back to List
Content and organization
Syllabus
- Introduction
- The Nearest Neighbour algorithm
- Tree predictors
- Statistical learning
- Risk analysis for tree predictors
- Hyperparameter tuning and risk estimates
- Consistency and nonparametric algorithms
- Risk analysis for Nearest Neighbour
- Linear predictors
- Online gradient descent
- Kernel functions
- Support Vector Machines
- Stability and risk control for SVM
- Neural networks and deep learning
- Logistic regression and surrogate loss functions
- Boosting and ensemble methods
Level
Graduate
Course Duration
48
Course Type
Semester Course
Marking Scheme
The final grade is the arithmetic average (rounded to the nearest integer) of the mark obtained in the written test and the mark obtained in the project. The exam is passed if: the average is 18 or higher and both marks are 17 or higher.
Participation terms
Free to anyone. Maximal registrant number: 10 students. If you are an AIDA Student* already, please: Step (a): Register in the course by sending an email to the Course Lecturer for your registration. AND Step (b): Enroll in the same course in the AIDA course link using the ‘Enroll on this course’ button therein, so that this course enters your AIDA Certificate of Course Attendance. If you are not an AIDA Student do only step (a). *AIDA Students should have been registered in the AIDA system already (they are PhD students or PostDocs that belong only to the AIDA Members listed in this page: Members)
Lecture Plan
Every Monday 14:30-16:30 and Tuesday 11:30-13:30
Language
English
Modality (online/in person):
In person
