1 code implementation • 2 Nov 2022 • Carol Mak, Fabian Zaiser, Luke Ong
A challenging problem in probabilistic programming is to develop inference algorithms that work for arbitrary programs in a universal probabilistic programming language (PPL).
1 code implementation • 18 Jun 2021 • Carol Mak, Fabian Zaiser, Luke Ong
A challenging goal is to develop general purpose inference algorithms that work out-of-the-box for arbitrary programs in a universal probabilistic programming language (PPL).
no code implementations • 8 Apr 2020 • Carol Mak, C. -H. Luke Ong, Hugo Paquet, Dominik Wagner
We give SPCF a sampling-style operational semantics a la Borgstrom et al., and study the associated weight (commonly referred to as the density) function and value function on the set of possible execution traces.
no code implementations • 19 Feb 2020 • Carol Mak, Luke Ong
Building on the observation that reverse-mode automatic differentiation (AD) -- a generalisation of backpropagation -- can naturally be expressed as pullbacks of differential 1-forms, we design a simple higher-order programming language with a first-class differential operator, and present a reduction strategy which exactly simulates reverse-mode AD.