MA-INF 1218: Algorithms and Uncertainty

Lecture

When Where Start Lecturer
Monday, 12:15-13:45 CP1-HSZ / Hörsaal 3 October 9 Kesselheim
Wednesday, 12:15-13:45 CP1-HSZ / Hörsaal 3 October 11 Kesselheim

Tutorials

When Where Start Lecturer
Wednesday, 14:15-15:45 Seminar Room 2.050 October 11 Heuser
Thursday, 10:15-11:45 Seminar Room 2.050 October 12 Heuser

Content

In many application scenarios, algorithms have to make decisions under some kind of uncertainty. This affects different kinds of problems. For example, when planing a route, a navigation system should take into consideration the traffic. Also, any machine-learning problem is about some kind of uncertainty. A random sample of data is used as a representative for the entire world.

In this course, we will get to know different techniques to model uncertainty and what approaches algorithms can use to cope with it. We will cover topics such as

  • Online Algorithms
  • Online Learning Algorithms and Online Convex Optimization
  • Markov Decisions Processes
  • Stochastic and Robust Optimization

Exams

The exams will be oral.

Prerequisites

You should bring a solid background in algorithms, calculus, and probability theory. Specialized knowledge about certain algorithms is not necessary.


Page Tools