arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2205.04324stat.ME
收藏

关于图模型更广泛的一类先验分布

On a wider class of prior distributions for graphical models

Abhinav Natarajan, Willem van den Boom, Kristoforus Bryant Odang, Maria De Iorio

AI总结:

本文针对高斯图模型贝叶斯推断中图空间指数增长的问题,提出在循环空间上基于循环基线性组合构造新型先验,并实现MCMC算法,在缩小搜索空间的同时保持后验边包含估计的准确性。

摘要:

高斯图模型是用于多变量随机变量条件独立结构推断的有用工具。不幸的是,由于$\mathcal{G}_n$(即$n$个顶点上所有图的集合)呈指数增长,潜在图结构的贝叶斯推断面临巨大挑战。为解决这一问题,已有一种方法是将搜索限制在$\mathcal{G}_n$的子集上。本文研究以循环空间$\mathcal{C}_n$为主要示例的向量子空间类子集。我们基于循环基元素的线性组合,提出了一种定义在$\mathcal{C}_n$上的新型先验,并给出了其理论性质。利用该先验,我们实现了马尔可夫链蒙特卡罗算法,并证明:(i) 尽管搜索的图空间更小,用我们的技术计算得到的后验边包含估计与标准技术的估计结果具有可比性;(ii) 向量空间的视角使得MCMC算法能够直接实现。

英文摘要:

Gaussian graphical models are useful tools for conditional independence structure inference of multivariate random variables. Unfortunately, Bayesian inference of latent graph structures is challenging due to exponential growth of $\mathcal{G}_n$, the set of all graphs in $n$ vertices. One approach that has been proposed to tackle this problem is to limit search to subsets of $\mathcal{G}_n$. In this paper, we study subsets that are vector subspaces with the cycle space $\mathcal{C}_n$ as main example. We propose a novel prior on $\mathcal{C}_n$ based on linear combinations of cycle basis elements and present its theoretical properties. Using this prior, we implement a Markov chain Monte Carlo algorithm, and show that (i) posterior edge inclusion estimates computed with our technique are comparable to estimates from the standard technique despite searching a smaller graph space, and (ii) the vector space perspective enables straightforward implementation of MCMC algorithms.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑