Accelerating Bayesian Structure Learning in Sparse Gaussian Graphical Models
From MaRDI portal
Publication:6110023
Abstract: Gaussian graphical models are relevant tools to learn conditional independence structure between variables. In this class of models, Bayesian structure learning is often done by search algorithms over the graph space. The conjugate prior for the precision matrix satisfying graphical constraints is the well-known G-Wishart. With this prior, the transition probabilities in the search algorithms necessitate evaluating the ratios of the prior normalizing constants of G-Wishart. In moderate to high-dimensions, this ratio is often approximated using sampling-based methods as computationally expensive updates in the search algorithm. Calculating this ratio so far has been a major computational bottleneck. We overcome this issue by representing a search algorithm in which the ratio of normalizing constant is carried out by an explicit closed-form approximation. Using this approximation within our search algorithm yields significant improvement in the scalability of structure learning without sacrificing structure learning accuracy. We study the conditions under which the approximation is valid. We also evaluate the efficacy of our method with simulation studies. We show that the new search algorithm with our approximation outperforms state-of-the-art methods in both computational efficiency and accuracy. The implementation of our work is available in the R package BDgraph.
Cites work
- scientific article; zbMATH DE number 1134987 (Why is no real title available?)
- scientific article; zbMATH DE number 1865746 (Why is no real title available?)
- A Monte Carlo method for computing the marginal likelihood in nondecomposable Gaussian graphical models
- A double Metropolis–Hastings sampler for spatial models with intractable normalizing constants
- A loss‐based prior for Gaussian graphical models
- Bayesian graphical Lasso models and efficient posterior computation
- Bayesian inference for general Gaussian graphical models with application to multivariate lattice data
- Bayesian inference in the presence of intractable normalizing functions
- Bayesian structure learning in sparse Gaussian graphical models
- Copula Gaussian graphical models and their application to modeling functional disability data
- Efficient Gaussian graphical model determination under G-Wishart prior distributions
- Exact formulas for the normalizing constants of Wishart distributions for graphical models
- Gaussian Markov Random Fields
- Hierarchical Gaussian graphical models: beyond reversible jump
- Hyper Inverse Wishart Distribution for Non-decomposable Graphs and its Application to Bayesian Inference for Gaussian Graphical Models
- Reversible jump Markov chain Monte Carlo computation and Bayesian model determination
- Sparse inverse covariance estimation with the graphical lasso
- Statistical mechanics of complex networks
- The G-Wishart Weighted Proposal Algorithm: Efficient Posterior Computation for Gaussian Graphical Models
- Wishart distributions for decomposable graphs
Cited in
(9)- Inferring sparse Gaussian graphical models with latent structure
- Parallel Sampling of Decomposable Graphs Using Markov Chains on Junction Trees
- Bayesian sparse covariance decomposition with a graphical structure
- The G-Wishart Weighted Proposal Algorithm: Efficient Posterior Computation for Gaussian Graphical Models
- Guest editors' introduction to the special issue ``Network psychometrics in action: methodological innovations inspired by empirical problems
- scientific article; zbMATH DE number 7255155 (Why is no real title available?)
- Bayesian structure learning for graphical models with symmetry constraints
- Bayesian Structure Learning in Undirected Gaussian Graphical Models: Literature Review with Empirical Comparison
- Asymptotic Bayesian structure learning using graph supports for Gaussian graphical models
This page was built for publication: Accelerating Bayesian Structure Learning in Sparse Gaussian Graphical Models
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6110023)
