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

We define a new denotational semantics for a first-order probabilistic programming language in terms of probabilistic event structures. The semantics adequately models the language, in the sense that the usual measure-theoretic semantics of a program can be recovered from its event structure representation.

Moreover it is intensional: occurrences of sampling and conditioning are recorded as explicit events, partially ordered according to the dependencies between the corresponding variables. This information can be leveraged for MCMC inference: we prove correct a version of single-site Metropolis-Hastings with ‘incremental recomputation’: the proposal kernel takes into account those dependencies in order to avoid performing some of the redundant sampling.

Tue 15 Jan

Displayed time zone: Belfast change

16:00 - 17:30
16:00
30m
Talk
Probabilistic Programming Inference via Intensional Semantics
LAFI
Simon Castellan , Hugo Paquet University of Cambridge
16:30
30m
Talk
Factorized Exact Inference for Discrete Probabilistic Programs
LAFI
Steven Holtzen University of California, Los Angeles, Joe Qian University of California, Los Angeles, Todd Millstein University of California, Los Angeles, Guy Van den Broeck University of California, Los Angeles
17:00
30m
Talk
Verified Equational Reasoning on a Little Language of Measures
LAFI
Matthew Heimerdinger Indiana University, Chung-chieh Shan Indiana University, USA