paper-with-me

Papers

Augmentation Schemes for Particle MCMC

2014-08-29 · Paul Fearnhead, Loukia Meligkotsidou

Particle MCMC involves using a particle filter within an MCMC algorithm. For inference of a model which involves an unobserved stochastic process, the standard implementation uses the particle filter to propose new values for the stochastic process, and MCMC moves to propose new values for the parameters. We show how particle MCMC can be generalised beyond this. Our key idea is to introduce new latent variables. We then use the MCMC moves to update the latent variables, and the particle filter to propose new values for the parameters and stochastic process given the latent variables. A generic way of defining these latent variables is to model them as pseudo-observations of the parameters or of the stochastic process. By choosing the amount of information these latent variables have about the parameters and the stochastic process we can often improve the mixing of the particle MCMC algorithm by trading off the Monte Carlo error of the particle filter and the mixing of the MCMC moves. We show that using pseudo-observations within particle MCMC can improve its efficiency in certain scenarios: dealing with initialisation problems of the particle filter; speeding up the mixing of particle Gibbs when there is strong dependence between the parameters and the stochastic process; and enabling further MCMC steps to be used within the particle filter.

📄 PDF Abstract BibTeX arXiv:1408.6980

Code (0)

등록된 구현이 없습니다.

Similar Papers 제목 키워드 기반

Stochastic Gradient MCMC with Repulsive Forces

2018-11-30 · Victor Gallego, David Rios Insua

We propose a unifying view of two different Bayesian inference algorithms, Stochastic Gradient Markov Chain Monte Carlo (SG-MCMC) and Stein Variational Gradient Descent (SVGD), leading to improved and efficient novel sam…

Bayesian Inferencevalid

Group Importance Sampling for Particle Filtering and MCMC

2017-04-10 · L. Martino, V. Elvira, G. Camps-Valls

Bayesian methods and their implementations by means of sophisticated Monte Carlo techniques have become very popular in signal processing over the last years. Importance Sampling (IS) is a well-known Monte Carlo techniqu…

Gaussian Processes

Particle Optimization in Stochastic Gradient MCMC

2017-11-29 · Changyou Chen, Ruiyi Zhang

Stochastic gradient Markov chain Monte Carlo (SG-MCMC) has been increasingly popular in Bayesian learning due to its ability to deal with large data. A standard SG-MCMC algorithm simulates samples from a discretized-time…

A Unified Particle-Optimization Framework for Scalable Bayesian Sampling

2018-05-29 · Changyou Chen, Ruiyi Zhang, Wenlin Wang, Bai Li 외

There has been recent interest in developing scalable Bayesian sampling methods such as stochastic gradient MCMC (SG-MCMC) and Stein variational gradient descent (SVGD) for big-data analysis. A standard SG-MCMC algorithm…

Interacting Particle Markov Chain Monte Carlo

2016-02-16 · Tom Rainforth, Christian A. Naesseth, Fredrik Lindsten, Brooks Paige 외

We introduce interacting particle Markov chain Monte Carlo (iPMCMC), a PMCMC method based on an interacting pool of standard and conditional sequential Monte Carlo samplers. Like related methods, iPMCMC is a Markov chain…