arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2202.09512cs.DC
收藏

Exascale数据的分布式非负RESCAL及其自动模型选择

Distributed non-negative RESCAL with Automatic Model Selection for Exascale Data

Manish Bhattarai, Namita Kharat, Erik Skau, Benjamin Nebgen, Hristo Djidjev, Sanjay Rajopadhye, James P. Smith, Boian Alexandrov

摘要:

随着计算机硬件和软件、社交媒体、物联网平台和通信的蓬勃发展,世界各地产生的数据量呈指数级增长。在这些数据中,关系数据集越来越受欢迎,因为它们提供了关于社区及其交互的演变的独特见解。关系数据集自然是非负的,稀疏的,超大的。关系数据通常包含三元组(主体、关系、对象),并表示为图/多重图,称为知识图谱,需要嵌入到低维稠密向量空间中。在各种嵌入模型中,RESCAL允许学习关系数据,以提取潜在变量的后验分布,并对缺失的关系进行预测。然而,RESCAL对计算要求很高,需要快速和分布式的实现来分析超大的真实世界数据集。在这里,我们介绍了一个分布式的非负RESCAL算法的异构CPU/GPU架构与自动选择的数量的潜在社区(模型选择),称为pyDRESCALK。我们用真实世界和大型合成张量证明了pyDRESCALK的正确性,以及与理论复杂性一致的近线性缩放的功效。最后,pyDRESCALK确定了11 TB密集和9 EB稀疏合成张量中潜在社区的数量。

英文摘要:

With the boom in the development of computer hardware and software, social media, IoT platforms, and communications, there has been an exponential growth in the volume of data produced around the world. Among these data, relational datasets are growing in popularity as they provide unique insights regarding the evolution of communities and their interactions. Relational datasets are naturally non-negative, sparse, and extra-large. Relational data usually contain triples, (subject, relation, object), and are represented as graphs/multigraphs, called knowledge graphs, which need to be embedded into a low-dimensional dense vector space. Among various embedding models, RESCAL allows learning of relational data to extract the posterior distributions over the latent variables and to make predictions of missing relations. However, RESCAL is computationally demanding and requires a fast and distributed implementation to analyze extra-large real-world datasets. Here we introduce a distributed non-negative RESCAL algorithm for heterogeneous CPU/GPU architectures with automatic selection of the number of latent communities (model selection), called pyDRESCALk. We demonstrate the correctness of pyDRESCALk with real-world and large synthetic tensors, and the efficacy showing near-linear scaling that concurs with the theoretical complexities. Finally, pyDRESCALk determines the number of latent communities in an 11-terabyte dense and 9-exabyte sparse synthetic tensor.

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

↑