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

12 citations · 20 across the 4 of their papers we have counts for

collaborators
Showing cs.PLShow all

1 paper · 1 filter

cs.PL2023

Fast and Correct Gradient-Based Optimisation for Probabilistic Programming via Smoothing

Basim Khajwal, C. -H. Luke Ong, Dominik Wagner

We study the foundations of variational inference, which frames posterior inference as an optimisation problem, for probabilistic programming. The dominant approach for optimisatio…