Probabilistic inference by program transformation in hakaru

65Citations
Citations of this article
22Readers
Mendeley users who have this article in their library.
Get full text

Abstract

We present Hakaru, a new probabilistic programming systemthat allows composable reuse of distributions, queries, and inference algorithms, all expressed in a single language of measures. The system implements two automatic and semantics-preserving program transformations—disintegration, which calculates conditional distributions, and simplification, which subsumes exact inference by computer algebra. We show how these features work together by describing the ideal workflow of a Hakaru user on two small problems. We highlight our composition of transformations and types in design and implementation.

Cite

CITATION STYLE

APA

Narayanan, P., Carette, J., Romano, W., Shan, C. C., & Zinkov, R. (2016). Probabilistic inference by program transformation in hakaru. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 9613, pp. 62–79). Springer Verlag. https://doi.org/10.1007/978-3-319-29604-3_5

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free