吸引高斯马尔可夫随机场的正定M-矩阵估计与结构学习
Estimation of positive definite M-matrices and structure learning for attractive Gaussian Markov Random fields
摘要:
考虑一个二阶矩有限的随机向量。如果其精度矩阵是M矩阵,则所有偏相关是非负的。如果该随机向量另外是高斯的,则对应的马尔可夫随机场(GMRF)被称为吸引的。本文研究了利用符号约束对数行列式发散最小化方法估计M-矩阵的逆二阶矩或精度矩阵。我们还处理高维的情况下,变量的数量超过样本量。额外的符号约束大大简化了估计问题:我们提供的证据表明,显式正则化不再需要。为了解决由此产生的凸优化问题,我们提出了一种基于块坐标下降的算法,其中每个子问题可以转化为非负最小二乘问题。提供了模拟和真实世界数据的插图。
英文摘要:
Consider a random vector with finite second moments. If its precision matrix is an M-matrix, then all partial correlations are non-negative. If that random vector is additionally Gaussian, the corresponding Markov random field (GMRF) is called attractive. We study estimation of M-matrices taking the role of inverse second moment or precision matrices using sign-constrained log-determinant divergence minimization. We also treat the high-dimensional case with the number of variables exceeding the sample size. The additional sign-constraints turn out to greatly simplify the estimation problem: we provide evidence that explicit regularization is no longer required. To solve the resulting convex optimization problem, we propose an algorithm based on block coordinate descent, in which each sub-problem can be recast as non-negative least squares problem. Illustrations on both simulated and real world data are provided.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。