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 161–170 of 273 papers

TitleStatusHype
Expectation Programming: Adapting Probabilistic Programming Systems to Estimate Expectations Efficiently—0
FACTORIE: Probabilistic Programming via Imperatively Defined Factor Graphs—0
Fast and Correct Gradient-Based Optimisation for Probabilistic Programming via Smoothing—0
flip-hoisting: Exploiting Repeated Parameters in Discrete Probabilistic Programs—0
Formal Analysis and Redesign of a Neural Network-Based Aircraft Taxiing System with VerifAI—0
From Probabilistic Programming to Complexity-based Programming—0
Gaussian Processes to speed up MCMC with automatic exploratory-exploitation effect—0
ScenicNL: Generating Probabilistic Scenario Programs from Natural Language—0
Graph Tracking in Dynamic Probabilistic Programs via Source Transformations—0
Guaranteed Bounds for Posterior Inference in Universal Probabilistic Programming—0
Show:102550
← PrevPage 17 of 28Next →

No leaderboard results yet.