Scaling it up: stochastic search structure learning in graphical models

From MaRDI portal
Publication:273600

DOI10.1214/14-BA916zbMATH Open1335.62068arXiv1505.01687OpenAlexW3101022954MaRDI QIDQ273600FDOQ273600


Authors: Hao Wang Edit this on Wikidata


Publication date: 22 April 2016

Published in: Bayesian Analysis (Search for Journal in Brave)

Abstract: Gaussian concentration graph models and covariance graph models are two classes of graphical models that are useful for uncovering latent dependence structures among multivariate variables. In the Bayesian literature, graphs are often determined through the use of priors over the space of positive definite matrices with fixed zeros, but these methods present daunting computational burdens in large problems. Motivated by the superior computational efficiency of continuous shrinkage priors for regression analysis, we propose a new framework for structure learning that is based on continuous spike and slab priors and uses latent variables to identify graphs. We discuss model specification, computation, and inference for both concentration and covariance graph models. The new approach produces reliable estimates of graphs and efficiently handles problems with hundreds of variables.


Full work available at URL: https://arxiv.org/abs/1505.01687




Recommendations




Cites Work


Cited In (46)

Uses Software





This page was built for publication: Scaling it up: stochastic search structure learning in graphical models

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q273600)