Practical Uncertainty in Machine Learning

Datum

22.11.2021

Zeit

13:30 - 15:00

Sprecher

Prof. Philipp Hennig

Zugehörigkeit

University Tübingen / TUEAI

Sprache

en

Hauptthema

Informatik

Host

ScaDS.AI Dresden/Leipzig

Beschreibung

Like any good scientist, a decent machine learning method should be able to estimate its own error. Such quantified uncertainty has many uses beyond the basic error bar: It provides the principled mechanisms to guide exploration and active learning, motivate and critique design choices, and trade off the utility of information from multiple sources. Probability Theory provides the universal and rigorous framework to quantify and manipulate uncertainty. The application of this formalism — Bayesian inference — has a reputation to be complicated and expensive. This tutorial will try to dispel this myth. Starting from basic examples we will get to know the Gaussian case a practically-minded workhorse of Bayesian inference, which maps the abstract notions of probability theory onto basic linear algebra. We will then see that modern automatic differentiation tools allow us to transfer this rich language to virtually all of modern machine learning. In particular, we will see how quantified uncertainty can be constructed simply in deep learning, at low computational and implementation overhead.

Links

• Program and registration

Letztmalig verändert: 24.11.2021, 08:26:37