Blogs (1) >>
POPL 2019
Sun 13 - Sat 19 January 2019 Cascais, Portugal
Tue 15 Jan 2019 16:30 - 17:00 at Sala VI - D

In this work, we seek to close the performance gap between exact inference in discrete graphical models and discrete-valued finite-domain probabilistic programs. The key idea behind existing state-of-the-art inference procedures in discrete graphical models is to compile the graphical model into a representation known as a weighted Boolean formula (WBF), which is a symbolic representation of the joint probability distribution over the graphical model’s random variables. This symbolic representation exposes key structural elements of the distribution, such as independences between random variables. Then, inference is performed via a weighted sum of the models of the WBF, a process known as weighted model counting (WMC). This WMC process exploits the independences present in the WBF, and is thus efficient. Inference via WMC is currently the state-of-the-art exact inference strategy for discrete graphical models, probabilistic logic programming languages, and probabilistic databases.

Tue 15 Jan
Times are displayed in time zone: Greenwich Mean Time : Belfast change

16:00 - 17:30
16:00
30m
Talk
Probabilistic Programming Inference via Intensional Semantics
LAFI
Simon Castellan, Hugo PaquetUniversity of Cambridge
16:30
30m
Talk
Factorized Exact Inference for Discrete Probabilistic Programs
LAFI
Steven HoltzenUniversity of California, Los Angeles, Joe QianUniversity of California, Los Angeles, Todd MillsteinUniversity of California, Los Angeles, Guy Van den BroeckUniversity of California, Los Angeles
17:00
30m
Talk
Verified Equational Reasoning on a Little Language of Measures
LAFI
Matthew HeimerdingerIndiana University, Chung-chieh ShanIndiana University, USA