Machine Learning and Computational Complexity

ETH Zürich: Fall 2025

Course Description

This Bachelor’s seminar explores the computational foundations of machine learning. Creating algorithms that learn general rules from data is the backbone of modern artificial intelligence and data-driven discovery; we will explore the theoretical principles that dictate the potential and limitations of learning algorithms. Throughout the seminar, we will investigate several fundamental themes. We’ll examine the crucial trade-off between a model’s complexity and its ability to generalize to new, unseen data. We’ll ask what makes certain learning problems computationally hard while others are easy, and how the quantity, quality, and representation of data impact an algorithm’s performance. We’ll consider how interactive feedback and different learning protocols can lead to more efficient and powerful models.

Time: Friday 14–16h

Location: CHN D 44

For inquiries, please email Francesco Re at francesco.re@inf.ethz.ch.

When you send an email, please always include “Bachelor’s Seminar” in the subject line.


Course Schedule

Week Date Year Topic Presenters Reading
1 26.09.2025 Introductory Lecture
2 03.10.2025 1937 (Original Paper) The Annotated Turing (Chapters 12 & 13) Jael Nyffenegger, Noel Ullreich Petzold (2008)
3 10.10.2025 1937 / 1964 The Annotated Turing (Chapters 14 & 15)
A Formal Theory of Inductive Inference Part I
Hüseyin Deniz, Emre Özel
Luka Wedegaertner, Aurel Schmidig
Petzold (2008)
Solomonoff (1964)
4 17.10.2025 1964 / 1965 A Formal Theory of Inductive Inference Part II
On Universal Functions
Dario Bicker, Patrik Dobcsanyi
Ron Jost, Luca Oertig
Solomonoff (1964)
Rogers (1965)
5 24.10.2025 1967 / 1975 Language Identification in the Limit
Toward a Mathematical Theory of Inductive Inference
Valentin Lungershausen, Philipp Dönni
Jaron Niederer
Gold (1967)
Blum & Blum (1975)
6 31.10.2025 1980 / 1983 Inductive Inference of Formal Languages from Positive Data
Inductive Inference: Theory and Methods
Siran Seifeddini
Mattia Morelli, Timon Fatzer
Angluin (1980)
Angluin & Smith (1983)
7 07.11.2025 1984 / 1987 A Theory of the Learnable
Learning Regular Sets from Queries and Counterexamples
Dimana Pencheva, Thea Tingstig
Elena Aschmann, Leonard Schmidt
Valiant (1984)
Angluin (1987)

Lecturer

Avatar

Ryan Cotterell

Assistant Professor of Computer Science

ETH Zürich

Teaching Assistant