Sequential Monte Carlo for Graphical Models
نویسندگان
چکیده
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.
منابع مشابه
Inference Networks for Sequential Monte Carlo in Graphical Models
We introduce a new approach for amortizing inference in directed graphical models by learning heuristic approximations to stochastic inverses, designed specifically for use as proposal distributions in sequential Monte Carlo methods. We describe a procedure for constructing and learning a structured neural network which represents an inverse factorization of the graphical model, resulting in a ...
متن کاملSequential Monte Carlo methods for graphical models
Inference in probabilistic graphical models (PGMs) does typically not allow for analytical solutions, confining us to various approximative methods. We propose a sequential Monte Carlo (SMC) algorithm for inference in general PGMs. Via a sequential decomposition of the PGM we find a sequence of auxiliary distributions defined on a monotonically increasing sequence of probability spaces. By targ...
متن کاملBayesian Inference in Decomposable Graphical Models Using Sequential Monte Carlo Methods
In this study we present a sequential sampling methodology for Bayesian inference in decomposable graphical models. We recast the problem of graph estimation, which in general lacks natural sequential interpretation, into a sequential setting. Specifically, we propose a recursive Feynman-Kac model which generates a flow of junction tree distributions over a space of increasing dimensions and de...
متن کاملTowards Automated Sequential Monte Carlo for Probabilistic Graphical Models
We revisit the idea of using sequential Monte Carlo (SMC) for inference in general probabilistic graphical models. By constructing a sequence of auxiliary target distributions (also known as a sequential decomposition) based on the graph structure we can run a standard SMC sampler on the graph. In this paper we study the impact of the sequential decomposition on the accuracy of the SMC method b...
متن کاملDivide-and-Conquer with Sequential Monte Carlo
We propose a novel class of Sequential Monte Carlo (SMC) algorithms, appropriate for inference in probabilistic graphical models. This class of algorithms adopts a divide-and-conquer approach based upon an auxiliary tree-structured decomposition of the model of interest, turning the overall inferential task into a collection of recursively solved sub-problems. The proposed method is applicable ...
متن کامل