paper-with-me

Papers

Sequential Monte Carlo for Graphical Models

2014-02-03 · NeurIPS 2014 12 · Christian A. Naesseth, Fredrik Lindsten, Thomas B. Schön

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.

📄 PDF Abstract BibTeX arXiv:1402.0330

Code (0)

등록된 구현이 없습니다.

Methods 이 논문이 사용한 방법론

PGM A regularization criterion that, differently from dropout and its variants, is deterministic rather than random. It grounds on the…

Similar Papers 제목 키워드 기반

Inference Networks for Sequential Monte Carlo in Graphical Models

2016-02-22 · Brooks Paige, Frank Wood

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 C…

Graphical model inference: Sequential Monte Carlo meets deterministic approximations

2019-01-08 · NeurIPS 2018 12 · Fredrik Lindsten, Jouni Helske, Matti Vihola

Approximate inference in probabilistic graphical models (PGMs) can be grouped into deterministic methods and Monte-Carlo-based methods. The former can often provide accurate and rapid inferences, but are typically associ…

Exact and Approximate MCMC for Doubly-intractable Probabilistic Graphical Models Leveraging the Underlying Independence Model

2025-10-04 · Yujie Chen, Antik Chakraborty, Anindya Bhadra arxiv

Bayesian inference for doubly-intractable pairwise exponential graphical models typically involves variations of the exchange algorithm or approximate Markov chain Monte Carlo (MCMC) samplers. However, existing methods f…

Bayesian Inference

Divide-and-Conquer with Sequential Monte Carlo

2014-06-19 · Fredrik Lindsten, Adam M. Johansen, Christian A. Naesseth, Bonnie Kirkpatrick 외

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…

An Annealed Sequential Monte Carlo Method for Bayesian Phylogenetics

2019-03-13

We describe an "embarrassingly parallel" method for Bayesian phylogenetic inference, annealed Sequential Monte Carlo, based on recent advances in the Sequential Monte Carlo literature such as adaptive determination of an…