arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1806.07985math.NAcs.DCcs.MScs.NA
收藏

密集张量的并行非负CP分解

Parallel Nonnegative CP Decomposition of Dense Tensors

Wake Forest University(维克森林大学);Oak Ridge National Laboratory(橡树岭国家实验室)

Grey Ballard, Koby Hayashi, Ramakrishnan Kannan

AI总结:

本文提出一种分布式内存并行算法,用于计算密集张量的非负CP分解,通过并行化MTTKRP运算提升效率,验证了算法在数百节点上的扩展性及性能优势。

摘要:

CP张量分解是一种低秩近似方法。本文提出一种分布式内存并行算法和交替优化方法,用于计算密集张量的非负CP分解。主要任务是并行化矩阵化张量乘以Khatri-Rao积(MTTKRP)的瓶颈子计算。算法计算高效,利用维度树避免在交替方法中MTTKRPs内的冗余计算。我们的方法也是通信高效,使用多维处理器网格的数据分布和并行算法,可调优以最小化通信。我们在合成数据以及超光谱图像和神经科学动态功能连接数据上对软件进行了基准测试,证明了我们的算法能够扩展到数百个节点(最多4096核心),并且比现有并行软件更快且更通用。

英文摘要:

The CP tensor decomposition is a low-rank approximation of a tensor. We present a distributed-memory parallel algorithm and implementation of an alternating optimization method for computing a CP decomposition of dense tensor data that can enforce nonnegativity of the computed low-rank factors. The principal task is to parallelize the matricized-tensor times Khatri-Rao product (MTTKRP) bottleneck subcomputation. The algorithm is computation efficient, using dimension trees to avoid redundant computation across MTTKRPs within the alternating method. Our approach is also communication efficient, using a data distribution and parallel algorithm across a multidimensional processor grid that can be tuned to minimize communication. We benchmark our software on synthetic as well as hyperspectral image and neuroscience dynamic functional connectivity data, demonstrating that our algorithm scales well to 100s of nodes (up to 4096 cores) and is faster and more general than the currently available parallel software.

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

↑