arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2108.11571cs.LG
收藏

GNNSampler:弥合GNN采样算法与硬件之间的差距

GNNSampler: Bridging the Gap between Sampling Algorithms of GNN and Hardware

Institute of Computing Technology, CAS(中国科学院计算技术研究所);University of Chinese Academy of Sciences(中国科学院大学);Peking University(北京大学)

Xin Liu, Mingyu Yan, Shuhan Song, Zhengyang Lv, Wenming Li, Guangyu Sun, Xiaochun Ye, Dongrui Fan

摘要:

采样是图神经网络(GNN)训练中的一个关键操作,有助于降低成本。先前的文献已经探索了通过数学和统计方法来改进采样算法。然而,在采样算法和硬件之间存在差距。在不考虑硬件的情况下,算法设计者仅仅在算法级优化采样,错过了利用硬件特性提升现有采样算法效率的巨大潜力。在本文中,我们开创性地提出了一个统一的编程模型,主流的采样算法,称为GNNSampler,涵盖了各种类别的采样算法的关键过程。其次,利用硬件的特点,我们选择的数据局部性作为一个案例研究,并探讨数据局部性之间的节点和他们的邻居在一个图,以减轻不规则的内存访问采样。第三,我们在GNNSampler中对各种采样算法实现了局部感知优化,以优化一般采样过程。最后,我们着重在大型图数据集上进行实验,以分析训练时间,准确性和硬件级指标之间的相关性。大量的实验表明,我们的方法是通用的主流采样算法,并有助于显着减少训练时间,特别是在大规模的图形。

英文摘要:

Sampling is a critical operation in Graph Neural Network (GNN) training that helps reduce the cost. Previous literature has explored improving sampling algorithms via mathematical and statistical methods. However, there is a gap between sampling algorithms and hardware. Without consideration of hardware, algorithm designers merely optimize sampling at the algorithm level, missing the great potential of promoting the efficiency of existing sampling algorithms by leveraging hardware features. In this paper, we pioneer to propose a unified programming model for mainstream sampling algorithms, termed GNNSampler, covering the critical processes of sampling algorithms in various categories. Second, to leverage the hardware feature, we choose the data locality as a case study, and explore the data locality among nodes and their neighbors in a graph to alleviate irregular memory access in sampling. Third, we implement locality-aware optimizations in GNNSampler for various sampling algorithms to optimize the general sampling process. Finally, we emphatically conduct experiments on large graph datasets to analyze the relevance among training time, accuracy, and hardware-level metrics. Extensive experiments show that our method is universal to mainstream sampling algorithms and helps significantly reduce the training time, especially in large-scale graphs.

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

↑