arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2107.11316stat.ME
收藏

海量稀疏高斯图模型的贝叶斯可分级精度因子分析

Bayesian Scalable Precision Factor Analysis for Massive Sparse Gaussian Graphical Models

Noirrit Kiran Chandra, Peter Mueller, Abhra Sarkar

摘要:

我们提出了一种新的方法来估计精度矩阵的多元高斯数据,依赖于分解成一个低秩和对角分量。这样的分解对于建模大的协方差阵是非常流行的,因为它们允许基于潜在因子的表示,从而允许容易的推断。然而,由于缺乏计算上方便的表示,这限制了低到中等尺寸的问题的推理精度矩阵是不正确的。我们解决这个显着的差距,在文献中建立这样的分解精度矩阵的潜变量表示。建设导致一个有效的吉布斯采样器,规模非常好的高维问题远远超出了目前最先进的限制。有效地探索完整的后空间的能力,也可以很容易地评估模型的不确定性。分解至关重要的是,还允许我们适应稀疏诱导先验,将精度矩阵的无关紧要的条目缩小到零,使该方法适用于高维小样本稀疏设置。然后,通过一种新的后验错误发现率控制过程确定编码底层条件独立图的矩阵中的精确零。在较弱的正则性假设下,我们的方法获得了估计精度矩阵的一个近似极小极大最优后验集中率。我们通过合成实验评估该方法的经验性能,并说明其在两个不同应用领域的数据集的实际效用。

英文摘要:

We propose a novel approach to estimating the precision matrix of multivariate Gaussian data that relies on decomposing them into a low-rank and a diagonal component. Such decompositions are very popular for modeling large covariance matrices as they admit a latent factor based representation that allows easy inference. The same is however not true for precision matrices due to the lack of computationally convenient representations which restricts inference to low-to-moderate dimensional problems. We address this remarkable gap in the literature by building on a latent variable representation for such decomposition for precision matrices. The construction leads to an efficient Gibbs sampler that scales very well to high-dimensional problems far beyond the limits of the current state-of-the-art. The ability to efficiently explore the full posterior space also allows the model uncertainty to be easily assessed. The decomposition crucially additionally allows us to adapt sparsity inducing priors to shrink the insignificant entries of the precision matrix toward zero, making the approach adaptable to high-dimensional small-sample-size sparse settings. Exact zeros in the matrix encoding the underlying conditional independence graph are then determined via a novel posterior false discovery rate control procedure. A near minimax optimal posterior concentration rate for estimating precision matrices is attained by our method under mild regularity assumptions. We evaluate the method's empirical performance through synthetic experiments and illustrate its practical utility in data sets from two different application domains.

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

↑