activity
20202024
most citedDensities of Almost Surely Terminating Probabilistic Programs are Differentiable Almost Everywhere

12 citations · 24 across the 5 of their papers we have counts for

collaborators
Showing cs.LGShow all

2 papers · 1 filter

cs.LG2022

Nonparametric Involutive Markov Chain Monte Carlo

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). We p…

cs.LG2021★ 1 cited

Nonparametric Hamiltonian Monte Carlo

Carol Mak, Fabian Zaiser, Luke Ong

Probabilistic programming uses programs to express generative models whose posterior probability is then computed by built-in inference engines. A challenging goal is to develop ge…