tfp.mcmc: Modern Markov Chain Monte Carlo Tools Built for Modern Hardware

02/04/2020
by   Junpeng Lao, et al.
80

Markov chain Monte Carlo (MCMC) is widely regarded as one of the most important algorithms of the 20th century. Its guarantees of asymptotic convergence, stability, and estimator-variance bounds using only unnormalized probability functions make it indispensable to probabilistic programming. In this paper, we introduce the TensorFlow Probability MCMC toolkit, and discuss some of the considerations that motivated its design.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
01/24/2019

Fast Markov Chain Monte Carlo Algorithms via Lie Groups

From basic considerations of the Lie group that preserves a target proba...
research
10/17/2017

Data analysis recipes: Using Markov Chain Monte Carlo

Markov Chain Monte Carlo (MCMC) methods for sampling probability density...
research
11/30/2020

A Markov Chain Monte-Carlo Approach to Dose-Response Optimization Using Probabilistic Programming (RStan)

A hierarchical logistic regression Bayesian model is proposed and implem...
research
10/23/2020

No Free Lunch for Approximate MCMC

It is widely known that the performance of Markov chain Monte Carlo (MCM...
research
02/04/2019

Is There an Analog of Nesterov Acceleration for MCMC?

We formulate gradient-based Markov chain Monte Carlo (MCMC) sampling as ...
research
01/28/2018

Air Markov Chain Monte Carlo

We introduce a class of Adapted Increasingly Rarely Markov Chain Monte C...
research
08/05/2018

Diffusion approximations and control variates for MCMC

A new methodology is presented for the construction of control variates ...

Please sign up or login with your details

Forgot password? Click here to reset