Symbolic Disintegration with a Variety of Base Measures
Loading...
Can’t use the file because of accessibility barriers? Contact us
Date
Authors
Journal Title
Journal ISSN
Volume Title
Publisher
Permanent Link
Abstract
Disintegration is a relation on measures and a transformation on probabilistic programs that generalizes density calculation and conditioning, two operations widely used for exact and approximate inference. Existing program transformations that find a disintegration or density automatically are limited to a fixed base measure that is an independent product of Lebesgue and counting measures, so they are of no help in practical cases that require tricky reasoning about other base measures. We present the first disintegrator that handles variable base measures, including discrete-continuous mixtures, dependent products, and disjoint sums. By analogy with type inference, our disintegrator can check a given base measure as well as infer an unknown one that is principal. We derive the disintegrator and prove it sound by equational reasoning from semantic specifications. It succeeds in a variety of applications where disintegration and density calculation had not been previously mechanized.
Description
This record is for a(n) postprint of an article published by ACM Press in ACM Letters on Programming Languages and Systems on 2020-05-01; the version of record is available at https://doi.org/10.1145/3374208.
Keywords
Citation
Narayanan, Praveen, and Shan, Chung-chieh. "Symbolic Disintegration with a Variety of Base Measures." ACM Letters on Programming Languages and Systems, 2020-05-01, https://doi.org/10.1145/3374208.
Journal
ACM Letters on Programming Languages and Systems