Export Citations
Save this search
Please login to be able to save your searches and receive alerts for new content matching your search criteria.
- research-articleOctober 2024
Programmable MCMC with Soundly Composed Guide Programs
Proceedings of the ACM on Programming Languages (PACMPL), Volume 8, Issue OOPSLA2Article No.: 308, Pages 1051–1080https://doi.org/10.1145/3689748Probabilistic programming languages (PPLs) provide language support for expressing flexible probabilistic models and solving Bayesian inference problems. PPLs with programmable inference make it possible for users to obtain improved results by ...
GenSQL: A Probabilistic Programming System for Querying Generative Models of Database Tables
- Mathieu Huot,
- Matin Ghavami,
- Alexander K. Lew,
- Ulrich Schaechtle,
- Cameron E. Freer,
- Zane Shelby,
- Martin C. Rinard,
- Feras A. Saad,
- Vikash K. Mansinghka
Proceedings of the ACM on Programming Languages (PACMPL), Volume 8, Issue PLDIArticle No.: 179, Pages 790–815https://doi.org/10.1145/3656409This article presents GenSQL, a probabilistic programming system for querying probabilistic generative models of database tables. By augmenting SQL with only a few key primitives for querying probabilistic models, GenSQL enables complex Bayesian ...
Robust Resource Bounds with Static Analysis and Bayesian Inference
Proceedings of the ACM on Programming Languages (PACMPL), Volume 8, Issue PLDIArticle No.: 150, Pages 76–101https://doi.org/10.1145/3656380There are two approaches to automatically deriving symbolic worst-case resource bounds for programs: static analysis of the source code and data-driven analysis of cost measurements obtained by running the program. Static resource analysis is usually ...
- research-articleJuly 2023
Sequential Monte Carlo learning for time series structure discovery
ICML'23: Proceedings of the 40th International Conference on Machine LearningArticle No.: 1226, Pages 29473–29489This paper presents a new approach to automatically discovering accurate models of complex time series data. Working within a Bayesian non-parametric prior over a symbolic space of Gaussian process time series models, we present a novel structure learning ...
- doctoral_thesisJanuary 2023
Scalable Structure Learning, Inference, and Analysis with Probabilistic Programs
AbstractHow can we automate and scale up the processes of learning accurate probabilistic models of complex data and obtaining principled solutions to probabilistic inference and analysis queries? This thesis presents efficient techniques for addressing ...
- research-articleJune 2021
SPPL: probabilistic programming with fast exact symbolic inference
PLDI 2021: Proceedings of the 42nd ACM SIGPLAN International Conference on Programming Language Design and ImplementationPages 804–819https://doi.org/10.1145/3453483.3454078We 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 ...
Optimal approximate sampling from discrete probability distributions
Proceedings of the ACM on Programming Languages (PACMPL), Volume 4, Issue POPLArticle No.: 36, Pages 1–31https://doi.org/10.1145/3371104This paper addresses a fundamental problem in random variate generation: given access to a random source that emits a stream of independent fair bits, what is the most accurate and entropy-efficient algorithm for sampling from a discrete probability ...
- research-articleJune 2019
Gen: a general-purpose probabilistic programming system with programmable inference
PLDI 2019: Proceedings of the 40th ACM SIGPLAN Conference on Programming Language Design and ImplementationPages 221–236https://doi.org/10.1145/3314221.3314642Although probabilistic programming is widely used for some restricted classes of statistical models, existing systems lack the flexibility and efficiency needed for practical use with more challenging models arising in fields like computer vision and ...
Bayesian synthesis of probabilistic programs for automatic data modeling
Proceedings of the ACM on Programming Languages (PACMPL), Volume 3, Issue POPLArticle No.: 37, Pages 1–32https://doi.org/10.1145/3290350We present new techniques for automatically constructing probabilistic programs for data analysis, interpretation, and prediction. These techniques work with probabilistic domain-specific data modeling languages that capture key properties of a broad ...
- ArticleDecember 2016
A probabilistic programming approach to probabilistic data analysis
NIPS'16: Proceedings of the 30th International Conference on Neural Information Processing SystemsPages 2019–2027Probabilistic techniques are central to data analysis, but different approaches can be challenging to apply, combine, and compare. This paper introduces composable generative population models (CGPMs), a computational abstraction that extends directed ...