Sequential Monte Carlo for Graphical Models

02/03/2014
by   Christian A. Naesseth, et al.
0

We propose a new framework for how to use sequential Monte Carlo (SMC) algorithms for inference in probabilistic graphical models (PGM). Via a sequential decomposition of the PGM we find a sequence of auxiliary distributions defined on a monotonically increasing sequence of probability spaces. By targeting these auxiliary distributions using SMC we are able to approximate the full joint distribution defined by the PGM. One of the key merits of the SMC sampler is that it provides an unbiased estimate of the partition function of the model. We also show how it can be used within a particle Markov chain Monte Carlo framework in order to construct high-dimensional block-sampling algorithms for general PGMs.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
03/09/2021

Unbiased approximation of posteriors via coupled particle Markov chain Monte Carlo

Markov chain Monte Carlo (MCMC) is a powerful methodology for the approx...
research
02/22/2016

Inference Networks for Sequential Monte Carlo in Graphical Models

We introduce a new approach for amortizing inference in directed graphic...
research
10/23/2020

Accelerating Metropolis-Hastings with Lightweight Inference Compilation

In order to construct accurate proposers for Metropolis-Hastings Markov ...
research
06/10/2022

Approximating optimal SMC proposal distributions in individual-based epidemic models

Many epidemic models are naturally defined as individual-based models: w...
research
10/11/2015

Kernel Sequential Monte Carlo

We propose kernel sequential Monte Carlo (KSMC), a framework for samplin...
research
02/09/2015

Nested Sequential Monte Carlo Methods

We propose nested sequential Monte Carlo (NSMC), a methodology to sample...
research
03/12/2019

Elements of Sequential Monte Carlo

A core problem in statistics and probabilistic machine learning is to co...

Please sign up or login with your details

Forgot password? Click here to reset