Search Results for author: Marco F. Cusumano-Towner

Found 7 papers, 1 papers with code

Bayesian Synthesis of Probabilistic Programs for Automatic Data Modeling

no code implementations14 Jul 2019 Feras A. Saad, Marco F. Cusumano-Towner, Ulrich Schaechtle, Martin C. Rinard, Vikash K. Mansinghka

These techniques work with probabilistic domain-specific data modeling languages that capture key properties of a broad class of data generating processes, using Bayesian inference to synthesize probabilistic programs in these modeling languages given observed data.

Probabilistic Programming Time Series +1

Using probabilistic programs as proposals

no code implementations11 Jan 2018 Marco F. Cusumano-Towner, Vikash K. Mansinghka

Monte Carlo inference has asymptotic guarantees, but can be slow when using generic proposals.

Probabilistic Programming

AIDE: An algorithm for measuring the accuracy of probabilistic inference algorithms

no code implementations NeurIPS 2017 Marco F. Cusumano-Towner, Vikash K. Mansinghka

This paper introduces the auxiliary inference divergence estimator (AIDE), an algorithm for measuring the accuracy of approximate inference algorithms.

Variational Inference

Probabilistic programs for inferring the goals of autonomous agents

1 code implementation17 Apr 2017 Marco F. Cusumano-Towner, Alexey Radul, David Wingate, Vikash K. Mansinghka

Intelligent systems sometimes need to infer the probable goals of people, cars, and robots, based on partial observations of their motion.

Encapsulating models and approximate inference programs in probabilistic modules

no code implementations14 Dec 2016 Marco F. Cusumano-Towner, Vikash K. Mansinghka

This paper introduces the probabilistic module interface, which allows encapsulation of complex probabilistic models with latent variables alongside custom stochastic approximate inference machinery, and provides a platform-agnostic abstraction barrier separating the model internals from the host probabilistic inference system.

Measuring the non-asymptotic convergence of sequential Monte Carlo samplers using probabilistic programming

no code implementations7 Dec 2016 Marco F. Cusumano-Towner, Vikash K. Mansinghka

A key limitation of sampling algorithms for approximate inference is that it is difficult to quantify their approximation error.

Probabilistic Programming

Quantifying the probable approximation error of probabilistic inference programs

no code implementations31 May 2016 Marco F. Cusumano-Towner, Vikash K. Mansinghka

This paper introduces a new technique for quantifying the approximation error of a broad class of probabilistic inference programs, including ones based on both variational and Monte Carlo approaches.

Cannot find the paper you are looking for? You can Submit a new open access paper.