TL;DR
SPPL is a probabilistic programming language that automatically provides exact inference solutions by translating programs into sum-product expressions, enabling scalable and precise probabilistic reasoning.
Contribution
It introduces a novel translation from probabilistic programs to sum-product expressions supporting complex distributions and constraints, enhancing inference accuracy and efficiency.
Findings
Achieves up to 3500x speedups over existing symbolic systems.
Successfully verifies fairness of decision trees and computes rare event probabilities.
Handles mixed-type distributions and logical constraints effectively.
Abstract
We present the Sum-Product Probabilistic Language (SPPL), a new probabilistic programming language that automatically delivers exact solutions to a broad range of probabilistic inference queries. SPPL translates probabilistic programs into sum-product expressions, a new symbolic representation and associated semantic domain that extends standard sum-product networks to support mixed-type distributions, numeric transformations, logical formulas, and pointwise and set-valued constraints. We formalize SPPL via a novel translation strategy from probabilistic programs to sum-product expressions and give sound exact algorithms for conditioning on and computing probabilities of events. SPPL imposes a collection of restrictions on probabilistic programs to ensure they can be translated into sum-product expressions, which allow the system to leverage new techniques for improving the scalability…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Code & Models
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
