paper-with-me

Papers

Parameter elimination in particle Gibbs sampling

2019-10-30 · NeurIPS 2019 12 · Anna Wigren, Riccardo Sven Risuleo, Lawrence Murray, Fredrik Lindsten

Bayesian inference in state-space models is challenging due to high-dimensional state trajectories. A viable approach is particle Markov chain Monte Carlo, combining MCMC and sequential Monte Carlo to form "exact approximations" to otherwise intractable MCMC methods. The performance of the approximation is limited to that of the exact method. We focus on particle Gibbs and particle Gibbs with ancestor sampling, improving their performance beyond that of the underlying Gibbs sampler (which they approximate) by marginalizing out one or more parameters. This is possible when the parameter prior is conjugate to the complete data likelihood. Marginalization yields a non-Markovian model for inference, but we show that, in contrast to the general case, this method still scales linearly in time. While marginalization can be cumbersome to implement, recent advances in probabilistic programming have enabled its automation. We demonstrate how the marginalized methods are viable as efficient inference backends in probabilistic programming, and demonstrate with examples in ecology and epidemiology.

📄 PDF Abstract BibTeX arXiv:1910.14145

Code (1)

uu-sml/neurips2019-parameter-elimination 공식 구현

Tasks

Bayesian InferenceEpidemiologyProbabilistic ProgrammingState Space Models

Similar Papers 제목 키워드 기반

Inference in Kingman's Coalescent with Particle Markov Chain Monte Carlo Method

2013-05-03 · Yifei Chen, Xiaohui Xie

We propose a new algorithm to do posterior sampling of Kingman's coalescent, based upon the Particle Markov Chain Monte Carlo methodology. Specifically, the algorithm is an instantiation of the Particle Gibbs Sampling me…

parameter estimation

Ancestor Sampling for Particle Gibbs

2012-12-01 · NeurIPS 2012 12 · Fredrik Lindsten, Thomas Schön, Michael. I. Jordan

We present a novel method in the family of particle MCMC methods that we refer to as particle Gibbs with ancestor sampling (PG-AS). Similarly to the existing PG with backward simulation (PG-BS) procedure, we use backward…

State Space Models

Auxiliary MCMC and particle Gibbs samplers for parallelisable inference in latent dynamical systems

2023-03-01 · Adrien Corenflos, Simo Särkkä

Sampling from the full posterior distribution of high-dimensional non-linear, non-Gaussian latent dynamical models presents significant computational challenges. While Particle Gibbs (also known as conditional sequential…

State Space Models

Particle Gibbs with Ancestor Sampling for Probabilistic Programs

2015-01-27 · Jan-Willem van de Meent, Hongseok Yang, Vikash Mansinghka, Frank Wood

Particle Markov chain Monte Carlo techniques rank among current state-of-the-art methods for probabilistic program inference. A drawback of these techniques is that they rely on importance resampling, which results in de…

Probabilistic Programming

De-Sequentialized Monte Carlo: a parallel-in-time particle smoother

2022-02-04 · Adrien Corenflos, Nicolas Chopin, Simo Särkkä

Particle smoothers are SMC (Sequential Monte Carlo) algorithms designed to approximate the joint distribution of the states given observations from a state-space model. We propose dSMC (de-Sequentialized Monte Carlo), a …