Trace types and denotational semantics for sound programmable inference in probabilistic languages

Trace types and denotational semantics for sound programmable inference in probabilistic languages. Lew, A. K., Cusumano-Towner, M. F., Sherman, B., Carbin, M., & Mansinghka, V. K. Proceedings of the ACM on Programming Languages, 4(POPL):19:1–19:32, ACM, January, 2020.

Paper

Link abstract bibtex

Modern probabilistic programming languages aim to formalize and automate key aspects of probabilistic modeling and inference. Many languages provide constructs for programmable inference that enable developers to improve inference speed and accuracy by tailoring an algorithm for use with a particular model or dataset. Unfortunately, it is easy to use these constructs to write unsound programs that appear to run correctly but produce incorrect results. To address this problem, we present a denotational semantics for programmable inference in higher-order probabilistic programming languages, along with a type system that ensures that well-typed inference programs are sound by construction. A central insight is that the type of a probabilistic expression can track the space of its possible execution traces, not just the type of value that it returns, as these traces are often the objects that inference algorithms manipulate. We use our semantics and type system to establish soundness properties of custom inference programs that use constructs for variational, sequential Monte Carlo, importance sampling, and Markov chain Monte Carlo inference.

@article{lew2020traces,
title                 = {Trace types and denotational semantics for sound programmable inference in probabilistic languages},
author                = {Lew, Alexander K. and Cusumano-Towner, Marco F. and Sherman, Benjamin and Carbin, Michale and Mansinghka, Vikash K.},
journal               = {Proceedings of the ACM on Programming Languages},
volume                = 4,
number                = {POPL},
month                 = jan,
year                  = 2020,
pages                 = {19:1--19:32},
articleno             = 19,
numpages              = 32,
publisher             = {ACM},
keywords              = {type systems, probabilistic programming, programmable inference},
url_paper             = {https://dl.acm.org/ft_gateway.cfm?id=3371087},
url_link              = {https://doi.org/10.1145/3371087},
abstract              = {Modern probabilistic programming languages aim to formalize and automate key aspects of probabilistic modeling and inference. Many languages provide constructs for programmable inference that enable developers to improve inference speed and accuracy by tailoring an algorithm for use with a particular model or dataset. Unfortunately, it is easy to use these constructs to write unsound programs that appear to run correctly but produce incorrect results. To address this problem, we present a denotational semantics for programmable inference in higher-order probabilistic programming languages, along with a type system that ensures that well-typed inference programs are sound by construction. A central insight is that the type of a probabilistic expression can track the space of its possible execution traces, not just the type of value that it returns, as these traces are often the objects that inference algorithms manipulate. We use our semantics and type system to establish soundness properties of custom inference programs that use constructs for variational, sequential Monte Carlo, importance sampling, and Markov chain Monte Carlo inference.},
}

Downloads: 0