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

用图形处理单元进行大规模精度矩阵估计的高效并行块坐标下降算法

An efficient parallel block coordinate descent algorithm for large-scale precision matrix estimation using graphics processing units

Young-Geun Choi, Seunghwan Lee, Donghyeon Yu

摘要:

大规模稀疏精度矩阵估计已经引起了统计学界的广泛兴趣。由Khare等人(2015)开发的凸偏相关选择方法(CONCORD)最近被认为具有估计稀疏精度矩阵的一些理论性质。CONCORD通过基于目标函数凸性的坐标下降算法(CONCORD-CD)获得其解。然而,由于CONCORD-CD中的坐标更新本质上是串行的,因此放大是不平凡的。在本文中,我们提出了一种新的并行CONCORD-CD,即CONCORD-PCD。CONCORD-PCD将非对角元素划分为几组,并同时更新每组,而不会损害CONCORD-CD的计算收敛性。我们保证这一点,采用的概念,边着色图论。具体来说,我们建立了一个非平凡的对应关系调度CONCORD-CD中的非对角元素的更新和着色一个完整的图的边缘。事实证明,CONCORD-PCD同时更新非对角元素,其中相关的边可以用相同的颜色着色。结果,更新非对角元素所需的步骤数量从p(p-1)/2减少到p-1(对于偶数p)或p(对于奇数p),其中p表示变量的数量。我们证明,这样的步骤的数量是不可减少的。此外,CONCORD-PCD是专为单指令多数据(SIMD)并行。数值研究表明,在图形处理单元(GPU)中实现的SIMD并行PCD算法提高了CONCORD-CD算法的数倍。

英文摘要:

Large-scale sparse precision matrix estimation has attracted wide interest from the statistics community. The convex partial correlation selection method (CONCORD) developed by Khare et al. (2015) has recently been credited with some theoretical properties for estimating sparse precision matrices. The CONCORD obtains its solution by a coordinate descent algorithm (CONCORD-CD) based on the convexity of the objective function. However, since a coordinate-wise update in CONCORD-CD is inherently serial, a scale-up is nontrivial. In this paper, we propose a novel parallelization of CONCORD-CD, namely, CONCORD-PCD. CONCORD-PCD partitions the off-diagonal elements into several groups and updates each group simultaneously without harming the computational convergence of CONCORD-CD. We guarantee this by employing the notion of edge coloring in graph theory. Specifically, we establish a nontrivial correspondence between scheduling the updates of the off-diagonal elements in CONCORD-CD and coloring the edges of a complete graph. It turns out that CONCORD-PCD simultaneously updates off-diagonal elements in which the associated edges are colorable with the same color. As a result, the number of steps required for updating off-diagonal elements reduces from p(p-1)/2 to p-1 (for even p) or p (for odd p), where p denotes the number of variables. We prove that the number of such steps is irreducible In addition, CONCORD-PCD is tailored to single-instruction multiple-data (SIMD) parallelism. A numerical study shows that the SIMD-parallelized PCD algorithm implemented in graphics processing units (GPUs) boosts the CONCORD-CD algorithm multiple times.

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

↑