The G-Wishart Weighted Proposal Algorithm: Efficient Posterior Computation for Gaussian Graphical Models

Abstract

Gaussian graphical models can capture complex dependency structures among variables. For such models, Bayesian inference is attractive as it provides principled ways to incorporate prior information and to quantify uncertainty through the posterior distribution. However, posterior computation under the conjugate G-Wishart prior distribution on the precision matrix is expensive for general non-decomposable graphs. We therefore propose a new Markov chain Monte Carlo (MCMC) method named the G-Wishart weighted proposal algorithm (WWA). WWA's distinctive features include delayed acceptance MCMC, Gibbs updates for the precision matrix and an informed proposal distribution on the graph space that enables embarrassingly parallel computations. Compared to existing approaches, WWA reduces the frequency of the relatively expensive sampling from the G-Wishart distribution. This results in faster MCMC convergence, improved MCMC mixing and reduced computing time. Numerical studies on simulated and real data show that WWA provides a more efficient tool for posterior inference than competing state-of-the-art MCMC algorithms.

44 pages, 6 figures

References in corpus (6)

• MCMC for doubly-intractable distributions
• Copula Gaussian graphical models and their application to modeling functional disability data
• Wishart distributions for decomposable graphs
• Scaling It Up: Stochastic Search Structure Learning in Graphical Models
• Unbiased approximation of posteriors via coupled particle Markov chain Monte Carlo
• Precision Matrix Estimation under the Horseshoe-like Prior-Penalty Dual

Cited by in corpus (3)

• Learning block structured graphs in Gaussian graphical models
• Bayesian Learning of Graph Substructures
• Change point detection in dynamic Gaussian graphical models: the impact of COVID-19 pandemic on the US stock market