113 citations · 510 across the 24 of their papers we have counts for
26 papers
PAP Spaces: Reasoning Denotationally About Higher-Order, Recursive Probabilistic and Differentiable Programs
Mathieu Huot, Alexander K. Lew, Vikash K. Mansinghka +1
We introduce a new setting, the category of PAP spaces, for reasoning denotationally about expressive differentiable and probabilistic programming languages. Our semantics is ge…
Affine Monads and Lazy Structures for Bayesian Programming
Swaraj Dash, Younesse Kaddar, Hugo Paquet +1
We show that streams and lazy data structures are a natural idiom for programming with infinite-dimensional Bayesian methods such as Poisson processes, Gaussian processes, jump pro…
ADEV: Sound Automatic Differentiation of Expected Values of Probabilistic Programs
Alexander K. Lew, Mathieu Huot, Sam Staton +1
Optimizing the expected values of probabilistic processes is a central problem in computer science and its applications, arising in fields ranging from artificial intelligence to o…
Quantum de Finetti Theorems as Categorical Limits, and Limits of State Spaces of C*-algebras
Sam Staton, Ned Summers
De Finetti theorems tell us that if we expect the likelihood of outcomes to be independent of their order, then these sequences of outcomes could be equivalently generated by drawi…
Concrete categories and higher-order recursion (With applications including probability, differentiability, and full abstraction)
Cristina Matache, Sean Moss, Sam Staton
We study concrete sheaf models for a call-by-value higher-order language with recursion. Our family of sheaf models is a generalization of many examples from the literature, such a…
Monads for Measurable Queries in Probabilistic Databases
Swaraj Dash, Sam Staton
We consider a bag (multiset) monad on the category of standard Borel spaces, and show that it gives a free measurable commutative monoid. Firstly, we show that a recent measurabili…