Accelerating Bayesian Structure Learning in Sparse Gaussian Graphical Models
加速稀疏高斯图模型的贝叶斯结构学习
Bayesian structure learning in Gaussian graphical models 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 by using sampling-based methods as…