SOTAVerified

Probabilistic Programming

Probabilistic programming languages are designed to describe probabilistic models and then perform inference in those models. PPLs are closely related to graphical models and Bayesian networks, but are more expressive and flexible.

( Image credit: Michael Betancourt )

Papers

Recently AddedMost HypedMost ActiveNeeds VerificationMost Verified

Showing 61–70 of 273 papers

TitleStatusHype
String Diagrams with Factorized Densities—0
Dimensionality Reduction as Probabilistic Inference—0
Black Box Variational Inference with a Deterministic Objective: Faster, More Accurate, and Even More Black BoxCode0
Probabilistic unifying relations for modelling epistemic and aleatoric uncertainty: semantics and automated reasoning with theorem proving—0
Neural Probabilistic Logic Programming in Discrete-Continuous Domains—0
ωPAP Spaces: Reasoning Denotationally About Higher-Order, Recursive Probabilistic and Differentiable Programs—0
Declarative Probabilistic Logic Programming in Discrete-Continuous Domains—0
Incorporating Expert Opinion on Observable Quantities into Statistical Models -- A General Framework—0
Automatically Marginalized MCMC in Probabilistic ProgrammingCode0
Fast and Correct Gradient-Based Optimisation for Probabilistic Programming via Smoothing—0
Show:102550
← PrevPage 7 of 28Next →

No leaderboard results yet.