arXivDaily arXiv每日学术速递 周一至周五更新
北美退伍军人节(Veterans Day),12 日无更新
arXiv 2106.06150cs.LGcs.DC
收藏

巨图上混合CPU-GPU训练的全局邻域抽样

Global Neighbor Sampling for Mixed CPU-GPU Training on Giant Graphs

University of California, Los Angeles(加利福尼亚大学洛杉矶分校);AWS AI(亚马逊云科技人工智能部门)

Jialin Dong, Da Zheng, Lin F. Yang, Geroge Karypis

摘要:

图神经网络(GNN)是用于从图数据学习的强大工具,并且广泛用于各种应用,诸如社交网络推荐、欺诈检测和图搜索。这些应用程序中的图通常很大,通常包含数亿个节点。在如此大的图上有效地训练GNN模型仍然是一个巨大的挑战。尽管已经提出了许多基于采样的方法来支持大型图上的小批量训练,但这些方法尚未被证明适用于真正的行业规模图,这些图需要GPU或混合CPU-GPU训练。最先进的基于采样的方法通常不会针对这些现实世界的硬件设置进行优化,其中CPU和GPU之间的数据移动是一个瓶颈。为了解决这个问题,我们提出了全局邻域采样,旨在在巨型图上训练GNN,专门用于混合CPU-GPU训练。该算法定期对所有小批量节点的全局缓存进行采样,并将其存储在GPU中。这种全局缓存允许小批量的GPU内重要性采样,这大大减少了小批量中的节点数量,特别是在输入层中,以减少CPU和GPU之间的数据复制和小批量计算,而不影响训练收敛速度或模型精度。我们提供了一个高效的实现这种方法,并表明我们的实现优于一个有效的节点明智的邻居采样基线的一个因素的2X-4X的巨型图。该算法的性能比具有小层数的LARKING算法高出2X-14 X倍,同时精度也比LARKING算法高得多。我们还从理论上分析了该算法,并表明在缓存节点数据大小合适的情况下,该算法的收敛速度与底层的逐节点采样方法相当。

英文摘要:

Graph neural networks (GNNs) are powerful tools for learning from graph data and are widely used in various applications such as social network recommendation, fraud detection, and graph search. The graphs in these applications are typically large, usually containing hundreds of millions of nodes. Training GNN models on such large graphs efficiently remains a big challenge. Despite a number of sampling-based methods have been proposed to enable mini-batch training on large graphs, these methods have not been proved to work on truly industry-scale graphs, which require GPUs or mixed-CPU-GPU training. The state-of-the-art sampling-based methods are usually not optimized for these real-world hardware setups, in which data movement between CPUs and GPUs is a bottleneck. To address this issue, we propose Global Neighborhood Sampling that aims at training GNNs on giant graphs specifically for mixed-CPU-GPU training. The algorithm samples a global cache of nodes periodically for all mini-batches and stores them in GPUs. This global cache allows in-GPU importance sampling of mini-batches, which drastically reduces the number of nodes in a mini-batch, especially in the input layer, to reduce data copy between CPU and GPU and mini-batch computation without compromising the training convergence rate or model accuracy. We provide a highly efficient implementation of this method and show that our implementation outperforms an efficient node-wise neighbor sampling baseline by a factor of 2X-4X on giant graphs. It outperforms an efficient implementation of LADIES with small layers by a factor of 2X-14X while achieving much higher accuracy than LADIES.We also theoretically analyze the proposed algorithm and show that with cached node data of a proper size, it enjoys a comparable convergence rate as the underlying node-wise sampling method.

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

↑