paper-with-me

홈 › Papers

Using probabilistic programs as proposals

2018-01-11 · Marco F. Cusumano-Towner, Vikash K. Mansinghka

Monte Carlo inference has asymptotic guarantees, but can be slow when using generic proposals. Handcrafted proposals that rely on user knowledge about the posterior distribution can be efficient, but are difficult to derive and implement. This paper proposes to let users express their posterior knowledge in the form of proposal programs, which are samplers written in probabilistic programming languages. One strategy for writing good proposal programs is to combine domain-specific heuristic algorithms with neural network models. The heuristics identify high probability regions, and the neural networks model the posterior uncertainty around the outputs of the algorithm. Proposal programs can be used as proposal distributions in importance sampling and Metropolis-Hastings samplers without sacrificing asymptotic consistency, and can be optimized offline using inference compilation. Support for optimizing and using proposal programs is easily implemented in a sampling-based probabilistic programming runtime. The paper illustrates the proposed technique with a proposal program that combines RANSAC and neural networks to accelerate inference in a Bayesian linear regression with outliers model.

📄 PDF Abstract BibTeX arXiv:1801.03612

Code (0)

등록된 구현이 없습니다.

Tasks

Probabilistic Programming

Methods 이 논문이 사용한 방법론

Linear Regression Linear Regression is a method for modelling a relationship between a dependent variable and independent variables. These models can be fit with numerous approaches. The most…

Similar Papers 제목 키워드 기반

Learning Proposals for Probabilistic Programs with Inference Combinators

2021-03-01 · Sam Stites, Heiko Zimmermann, Hao Wu, Eli Sennesh 외

We develop operators for construction of proposals in probabilistic programs, which we refer to as inference combinators. Inference combinators define a grammar over importance samplers that compose primitive operations …

Applications of Probabilistic Programming (Master's thesis, 2015)

2016-05-31 · Yura N. Perov

This thesis describes work on two applications of probabilistic programming: the learning of probabilistic program code given specifications, in particular program code of one-dimensional samplers; and the facilitation o…

Object RecognitionProbabilistic Programming

C3: Lightweight Incrementalized MCMC for Probabilistic Programs using Continuations and Callsite Caching

2015-09-07 · Daniel Ritchie, Andreas Stuhlmüller, Noah D. Goodman

Lightweight, source-to-source transformation approaches to implementing MCMC for probabilistic programming languages are popular for their simplicity, support of existing deterministic code, and ability to execute on exi…

Probabilistic Programming

Nonstandard Interpretations of Probabilistic Programs for Efficient Inference

2011-12-01 · NeurIPS 2011 12 · David Wingate, Noah Goodman, Andreas Stuhlmueller, Jeffrey M. Siskind

Probabilistic programming languages allow modelers to specify a stochastic process using syntax that resembles modern programming languages. Because the program is in machine-readable format, a variety of techniqu…

Probabilistic Programming

PClean: Bayesian Data Cleaning at Scale with Domain-Specific Probabilistic Programming

2020-07-23 · Alexander K. Lew, Monica Agrawal, David Sontag, Vikash K. Mansinghka

Data cleaning is naturally framed as probabilistic inference in a generative model of ground-truth data and likely errors, but the diversity of real-world error patterns and the hardness of inference make Bayesian approa…

DiversityProbabilistic Programming