Главная
Study mode:
on
1
Intro
2
nature Perspective
3
Probabilistic graphical models
4
Student's mood after an exam
5
Applications
6
Probabilistic GCL
7
Let's start simple
8
A loopy program For
9
Weakest pre-expectations
10
Examples
11
An operational perspective
12
Bayesian inference by program verification
13
Example: sampling within a circle
14
Weakest precondition of id-loops
15
Bayesian networks as programs
16
Soundness
17
Exact inference by wp-reasoning
18
Termination proofs: the classical case
19
Proving almost-sure termination
20
The symmetric random walk
21
Asymmetric-in-the-limit random walk
22
Positive almost-sure termination
23
Run-time invariant synthesis
24
Coupon collector's problem
25
Sampling time for example BN
26
The student's mood example
27
Experimental results
28
Printer troubleshooting in Windows 95
29
Predictive probabilistic programming
Description:
Explore Bayesian inference through the lens of program verification in this 45-minute talk by Joost-Pieter Katoen from RWTH Aachen University. Discover how weakest precondition reasoning can be applied to exact inference in Bayesian networks and learn about automated techniques for determining exact expected sampling times. Gain insights into the practical implications of these methods for deciding the appropriateness of sampling-based approaches for given Bayesian networks. Delve into topics such as probabilistic graphical models, weakest pre-expectations, and Bayesian networks as programs. Examine real-world applications, including student mood prediction and printer troubleshooting in Windows 95. This presentation, part of a workshop on combining logic and learning, offers a unique perspective on the intersection of formal methods and statistical approaches in understanding complex systems.

Bayesian Inference by Program Verification - Joost-Pieter Katoen, RWTH Aachen University

Alan Turing Institute
Add to list
0:00 / 0:00