GOSH:在小型硬件上嵌入大型图形
GOSH: Embedding Big Graphs on Small Hardware
摘要:
在图嵌入中,图的连通性信息用于将每个顶点表示为d维空间中的点。与原始的不规则结构信息不同,这种表示可以用于许多机器学习任务。虽然这个过程在实践中非常有用,但它确实很昂贵,不幸的是,图形变得越来越大,越来越难以嵌入。将该过程扩展到更大的图的尝试已经成功,但通常在硬件要求方面付出了高昂的代价。我们提出了GOSH,一种在单个GPU上以最小约束嵌入任意大小的图的方法。GOSH利用一种新颖的图形粗化方法来压缩图形,并最大限度地减少嵌入所需的工作,与最先进的技术相比,它可以在一小部分时间内提供高质量的嵌入。除此之外,它还集成了一种分解模式,可以使用单个GPU嵌入任何任意大的图形,对内存大小的限制最小。通过这些技术,GOSH能够在不到一个小时的时间内在单个GPU上嵌入一个具有超过6500万个顶点和18亿条边的图,并获得93%的AUCROC用于链接预测,通过运行该工具80分钟可以增加到95%。
英文摘要:
In graph embedding, the connectivity information of a graph is used to represent each vertex as a point in a d-dimensional space. Unlike the original, irregular structural information, such a representation can be used for a multitude of machine learning tasks. Although the process is extremely useful in practice, it is indeed expensive and unfortunately, the graphs are becoming larger and harder to embed. Attempts at scaling up the process to larger graphs have been successful but often at a steep price in hardware requirements. We present GOSH, an approach for embedding graphs of arbitrary sizes on a single GPU with minimum constraints. GOSH utilizes a novel graph coarsening approach to compress the graph and minimize the work required for embedding, delivering high-quality embeddings at a fraction of the time compared to the state-of-the-art. In addition to this, it incorporates a decomposition schema that enables any arbitrarily large graph to be embedded using a single GPU with minimum constraints on the memory size. With these techniques, GOSH is able to embed a graph with over 65 million vertices and 1.8 billion edges in less than an hour on a single GPU and obtains a 93% AUCROC for link-prediction which can be increased to 95% by running the tool for 80 minutes.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。