Compiling Stan to Generative Probabilistic Languages and Extension to Deep Probabilistic Programming
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.
Code (1)
Tasks
Probabilistic ProgrammingRepresentation LearningVariational InferenceSimilar Papers 제목 키워드 기반
Compiling by Proving: Language-Agnostic Automatic Optimization from Formal Semantics
Verification proofs encode complete program behavior, yet we discard them after checking correctness. We present compiling by proving, a paradigm that transforms these proofs into optimized execution rules. By constructi…
Dimensionality Reduction as Probabilistic Inference
Dimensionality reduction (DR) algorithms compress high-dimensional data into a lower dimensional representation while preserving important features of the data. DR is a critical step in many analysis pipelines as it enab…
Dimensionality ReductionGaussian ProcessesProbabilistic Programmingplingo: A system for probabilistic reasoning in clingo based on lpmln
We present plingo, an extension of the ASP system clingo with various probabilistic reasoning modes. Plingo is centered upon LP^MLN, a probabilistic extension of ASP based on a weight scheme from Markov Logic. This choic…
A Parameter-efficient Language Extension Framework for Multilingual ASR
Covering all languages with a multilingual speech recognition model (MASR) is very difficult. Performing language extension on top of an existing MASR is a desirable choice. In this study, the MASR continual learning pro…
Continual Learningparameter-efficient fine-tuningspeech-recognitionSpeech RecognitionSemirings for Probabilistic and Neuro-Symbolic Logic Programming
The field of probabilistic logic programming (PLP) focuses on integrating probabilistic models into programming languages based on logic. Over the past 30 years, numerous languages and frameworks have been developed for …