Bayesian learning of weakly structural Markov graph laws using sequential Monte Carlo methods
From MaRDI portal
(Redirected from Publication:2323943)
Abstract: We present a sequential sampling methodology for weakly structural Markov laws, arising naturally in a Bayesian structure learning context for decomposable graphical models. As a key component of our suggested approach, we show that the problem of graph estimation, which in general lacks natural sequential interpretation, can be recast into a sequential setting by proposing a recursive Feynman-Kac model that generates a flow of junction tree distributions over a space of increasing dimensions. We focus on particle McMC methods to provide samples on this space, in particular on particle Gibbs (PG), as it allows for generating McMC chains with global moves on an underlying space of decomposable graphs. To further improve the PG mixing properties, we incorporate a systematic refreshment step implemented through direct sampling from a backward kernel. The theoretical properties of the algorithm are investigated, showing that the proposed refreshment step improves the performance in terms of asymptotic variance of the estimated distribution. The suggested sampling methodology is illustrated through a collection of numerical examples demonstrating high accuracy in Bayesian graph structure learning in both discrete and continuous graphical models.
Recommendations
- Improving structure MCMC for Bayesian networks through Markov blanket resampling
- Structural Markov graph laws for Bayesian model uncertainty
- A Gibbs sampler for learning DAGs
- Structure learning in Bayesian networks of a moderate size by efficient sampling
- Learning undirected graphical models using persistent sequential Monte Carlo
Cites work
- scientific article; zbMATH DE number 1134987 (Why is no real title available?)
- A conjugate prior for discrete hierarchical log-linear models
- A fast procedure for model search in multidimensional contingency tables
- A structural Markov property for decomposable graph laws that allows control of clique intersections
- Bayesian clustering in decomposable graphs
- Comparison of asymptotic variances of inhomogeneous Markov chains with application to Markov chain Monte Carlo methods
- Decomposable graphical Gaussian model determination
- Efficient local updates for undirected graphical models
- Experiments in stochastic computation for high-dimensional graphical models
- Gaussian Markov distributions over finite graphs
- Hyper Markov laws in the statistical analysis of decomposable graphical models
- Inference in hidden Markov models.
- Markov chain Monte Carlo model determination for hierarchical and graphical log-linear models
- Model Selection and Accounting for Model Uncertainty in Graphical Models Using Occam's Window
- On particle Gibbs sampling
- Particle Markov Chain Monte Carlo Methods
- Sampling decomposable graphs using a Markov chain on junction trees
- Sequential Monte Carlo Samplers
- Sequential sampling of junction trees for decomposable graphs
- Two methods for the generation of chordal graphs
Cited in
(3)
This page was built for publication: Bayesian learning of weakly structural Markov graph laws using sequential Monte Carlo methods
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2323943)
