VVZ API is not affiliated with ETH Zurich. Data might be outdated or incorrect. Please view the official ETHZ Vorlesungsverzeichnis for binding information.

263-5300-00L 5 Credits BSC , DR , MSC D-ITET , D-MATH , D-INFK
You're viewing possible stale or outdated data. Please check the latest semester for more up-to-date information.

Guarantees for Machine Learning

Lecturers & Examiners: Prof. Dr. Fan Yang
VVZ CR n/a

Last Updated: 2026-02-05 15:41:56

Abstract

This course teaches classical and recent methods in statistics and optimization commonly used to prove theoretical guarantees for machine learning algorithms. The knowledge is then applied in project work that focuses on understanding phenomena in modern machine learning.

Objective

This course is aimed at advanced master and doctorate students who want to understand and/or conduct independent research on theory for modern machine learning. For this purpose, students will learn common mathematical techniques from statistical learning theory. In independent project work, they then apply their knowledge and go through the process of critically questioning recently published work, finding relevant research questions and learning how to effectively present research ideas to a professional audience.

Content

This course teaches some classical and recent methods in statistical learning theory aimed at proving theoretical guarantees for machine learning algorithms, including topics in - concentration bounds, uniform convergence - high-dimensional statistics (e.g. Lasso) - prediction error bounds for non-parametric statistics (e.g. in kernel spaces) - minimax lower bounds - regularization via optimization The project work focuses on active theoretical ML research that aims to understand modern phenomena in machine learning, including but not limited to - how overparameterization could help generalization ( interpolating models, linearized NN ) - how overparameterization could help optimization ( non-convex optimization, loss landscape ) - complexity measures and approximation theoretic properties of randomly initialized and trained NN - generalization of robust learning ( adversarial robustness, standard and robust error tradeoff ) - prediction with calibrated confidence ( conformal prediction, calibration )

Resources

Learning Materials (Links)

General Information

Language
English
Levels
BSC , DR , MSC
Frequency
Yearly recurring

Examination

Type
graded semester performance
Last cancellation/deregistration date for this graded semester performance: second Friday in March! Please note that after that date no deregistration will be accepted and a "no show" will appear on your transcript.one Midterm exam (50%)Homework (10%)Course project (40%)

Registration & Places

Limited places (Special selection)
Signup End
01.03.2020

Course Components

Type Title Time & Place Hours
lecture Guarantees for Machine Learning
Special selection process. Preference is given to Masters and Doctorate students. If need be other criteria are degree program and previous courses taken.
  • Wed 08:15-10:00 (CAB G 51)
2 h weekly
independent project Guarantees for Machine Learning No time listed 2 h weekly

Offered In