Compiling Stan to generative probabilistic languages and extension to deep probabilistic programming

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

Abstract

Stan is a probabilistic programming language that is popular in the statistics community, with a high-level syntax for expressing probabilistic models. Stan differs by nature from generative probabilistic programming languages like Church, Anglican, or Pyro. This paper presents a comprehensive compilation scheme to compile any Stan model to a generative language and proves its correctness. We use our compilation scheme to build two new backends for the Stanc3 compiler targeting Pyro and NumPyro. Experimental results show that the NumPyro backend yields a 2.3x speedup compared to Stan in geometric mean over 26 benchmarks. Building on Pyro we extend Stan with support for explicit variational inference guides and deep probabilistic models. That way, users familiar with Stan get access to new features without having to learn a fundamentally new language.

Cite

CITATION STYLE

APA

Baudart, G., Burroni, J., Hirzel, M., Mandel, L., & Shinnar, A. (2021). Compiling Stan to generative probabilistic languages and extension to deep probabilistic programming. In Proceedings of the ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI) (pp. 497–510). Association for Computing Machinery. https://doi.org/10.1145/3453483.3454058

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