Replication package for the article: Compiling Stan to Generative Probabilistic Languages and Extension to Deep Probabilistic Programming

2021 ◽  
Author(s):  
Guillaume Baudart ◽  
Javier Burroni ◽  
Martin Hirzel ◽  
Louis Mandel ◽  
Avraham Shinnar
Keyword(s):  
Probabilistic Programming ◽  
Probabilistic Languages

scholarly journals Publisher Correction: Universal probabilistic programming offers a powerful approach to statistical phylogenetics

2021 ◽  
Vol 4 (1) ◽  
Author(s):  
Fredrik Ronquist ◽  
Jan Kudlicka ◽  
Viktor Senderov ◽  
Johannes Borgström ◽  
Nicolas Lartillot ◽  
...  
Keyword(s):  
Probabilistic Programming ◽  
Powerful Approach

A Correction to this paper has been published: https://doi.org/10.1038/s42003-021-01922-8

scholarly journals Fabular: regression formulas as probabilistic programming

2016 ◽  
Vol 51 (1) ◽  
pp. 271-283
Author(s):  
Johannes Borgström ◽  
Andrew D. Gordon ◽  
Long Ouyang ◽  
Claudio Russo ◽  
Adam Ścibior ◽  
...  
Keyword(s):  
Probabilistic Programming

scholarly journals Lower bounds for the state complexity of probabilistic languages and the language of prime numbers

2020 ◽  
Vol 30 (1) ◽  
pp. 175-192
Author(s):  
NathanaËl Fijalkow
Keyword(s):  
Lower Bound ◽  
Lower Bounds ◽  
Prime Numbers ◽  
Regular Languages ◽  
Automata Theory ◽  
Seminal Paper ◽  
Probabilistic Automata ◽  
State Complexity ◽  
Probabilistic Languages ◽  
Alternating Automata

Abstract This paper studies the complexity of languages of finite words using automata theory. To go beyond the class of regular languages, we consider infinite automata and the notion of state complexity defined by Karp. Motivated by the seminal paper of Rabin from 1963 introducing probabilistic automata, we study the (deterministic) state complexity of probabilistic languages and prove that probabilistic languages can have arbitrarily high deterministic state complexity. We then look at alternating automata as introduced by Chandra, Kozen and Stockmeyer: such machines run independent computations on the word and gather their answers through boolean combinations. We devise a lower bound technique relying on boundedly generated lattices of languages, and give two applications of this technique. The first is a hierarchy theorem, stating that there are languages of arbitrarily high polynomial alternating state complexity, and the second is a linear lower bound on the alternating state complexity of the prime numbers written in binary. This second result strengthens a result of Hartmanis and Shank from 1968, which implies an exponentially worse lower bound for the same model.

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

2020 ◽  
Vol 4 (POPL) ◽  
pp. 1-32 ◽  
Author(s):  
Alexander K. Lew ◽  
Marco F. Cusumano-Towner ◽  
Benjamin Sherman ◽  
Michael Carbin ◽  
Vikash K. Mansinghka
Keyword(s):  
Denotational Semantics ◽  
Probabilistic Languages
Sign in / Sign up

Export Citation Format

Share Document