The linear operator semantics of probabilistic programs

Add to your list(s) Download to your calendar using vCal

• Fredrik Dahlqvist (UCL)
• Friday 11 November 2022, 13:30-14:20
• LG23, SoCS and Zoom (see abstract for link).

If you have a question about this talk, please contact George Kaye.

Zoom details

• Link: https://bham-ac-uk.zoom.us/j/81873335084?pwd=T1NaUFg2U1l6d0RLL2RlTzFBam1IUT09
• Meeting ID: 818 7333 5084
• Passcode: 217

Abstract

In this tutorial I will present a semantics for probabilistic programs in terms of linear operators. Mathematically, this is the natural universe in which to talk about probabilistic transition systems – both discrete and continuous – and it therefore makes sense to target this universe when defining a denotational semantics for probabilistic programming languages. I will describe how both higher-order functions and Bayesian inference can be interpreted in this framework. The focus of the tutorial will be on the discrete case which amounts to manipulating matrices, but I will also sketch some of the mathematics behind the general case. The linear operator semantics of probabilistic programs is originally due to Dexter Kozen, and the recent developments that I will describe in this talk are joint work with him too.

This talk is part of the Theoretical computer science seminar series.

This talk is included in these lists:

• Computer Science Departmental Series
• Computer Science Distinguished Seminars
• LG23, SoCS and Zoom (see abstract for link)
• Theoretical computer science seminar
• computer sience

Note that ex-directory lists are not shown.