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

227-0434-10L 8 Credits DR , MSC D-ITET , D-MATH , D-INFK , D-PHYS
You're viewing possible stale or outdated data. Please check the latest semester for more up-to-date information.

Mathematics of Information

Lecturers & Examiners: Prof. Dr. Helmut Bölcskei
VVZ CR 4.0

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

Abstract

The class focuses on mathematical aspects of1. Information science: Sampling theorems, frame theory, compressed sensing, sparsity, super-resolution, spectrum-blind sampling, subspace algorithms, dimensionality reduction2. Learning theory: Approximation theory, uniform laws of large numbers, Rademacher complexity, Vapnik-Chervonenkis dimension

Objective

The aim of the class is to familiarize the students with the most commonly used mathematical theories in data science, high-dimensional data analysis, and learning theory. The class consists of the lecture, exercise sessions with homework problems, and of a research project, which can be carried out either individually or in groups. The research project consists of either 1. software development for the solution of a practical signal processing or machine learning problem or 2. the analysis of a research paper or 3. a theoretical research problem of suitable complexity. Students are welcome to propose their own project at the beginning of the semester. The outcomes of all projects have to be presented to the entire class at the end of the semester.

Content

Mathematics of Information 1. Signal representations: Frame theory, wavelets, Gabor expansions, sampling theorems, density theorems 2. Sparsity and compressed sensing: Sparse linear models, uncertainty relations in sparse signal recovery, matching pursuits, super-resolution, spectrum-blind sampling, subspace algorithms (MUSIC, ESPRIT, matrix pencil), estimation in the high-dimensional noisy case, Lasso 3. Dimensionality reduction: Random projections, the Johnson-Lindenstrauss Lemma Mathematics of Learning 4. Approximation theory: Nonlinear approximation theory, fundamental limits on compressibility of signal classes, Kolmogorov-Tikhomirov epsilon-entropy of signal classes, optimal compression of signal classes, recovery from incomplete data, information-based complexity, curse of dimensionality 5. Uniform laws of large numbers: Rademacher complexity, Vapnik-Chervonenkis dimension, classes with polynomial discrimination, blessings of dimensionality

Resources

Lecture Notes

Detailed lecture notes will be provided at the beginning of the semester and as we go along.

Learning Materials (Links)

General Information

Language
English
Levels
DR , MSC
Frequency
Yearly recurring

Examination

Type
session examination
Mode
written 180 minutes
Aids
Lecture and exercise notes allowed. Electronic devices (laptops, calculators, cellphones, etc...) NOT allowed.
The written final exam (180 minutes) will contribute 75% towards the final grade. The remaining 25% will be awarded for a graded student project in the form of a group literature review. A pass grade in this project is a prerequisite for admission to the exam (compulsory continuous performance assessment). Students re-sitting the exam can decide at the beginning of the semester if they want to also repeat the student project (if previously passed).

Course Components

Type Title Time & Place Hours
lecture Mathematics of Information
  • Thu 09:15-12:00 (ETZ E 6)
3 h weekly
exercise Mathematics of Information
  • Mon 13:15-15:00 (ETZ E 6)
2 h weekly
independent project Mathematics of Information No time listed 2 h weekly

Offered In