The Beta-Bernoulli process and algebraic effects

Abstract

In this paper we use the framework of algebraic effects from programming language theory to analyze the Beta-Bernoulli process, a standard building block in Bayesian models. Our analysis reveals the importance of abstract data types, and two types of program equations, called commutativity and discardability. We develop an equational theory of terms that use the Beta-Bernoulli process, and show that the theory is complete with respect to the measure-theoretic semantics, and also in the syntactic sense of Post. Our analysis has a potential for being generalized to other stochastic processes relevant to Bayesian modelling, yielding new understanding of these processes from the perspective of programming.

arXiv commentTo appear in Proc. ICALP 2018

References in corpus (2)

• Commutative monads as a theory of distributions
• Contextual Equivalence for a Probabilistic Language with Continuous Random Variables and Recursion

Cited by in corpus (3)

• A synthetic approach to Markov kernels, conditional independence and theorems on sufficient statistics
• Compositional Semantics for Probabilistic Programs with Exact Conditioning
• A model of stochastic memoization and name generation in probabilistic programming: categorical semantics via monads on presheaf categories