Hardware Acceleration of Sampling Algorithms in Sample and Aggregate Graph Neural Networks
Not on the map. Why?
Abstract (arXiv)
Sampling is an important process in many GNN structures in order to train larger datasets with a smaller computational complexity. However, compared to other processes in GNN (such as aggregate, backward propagation), the sampling process still costs tremendous time, which limits the speed of training. To reduce the time of sampling, hardware acceleration is an ideal choice. However, state of the art GNN acceleration proposal did not specify how to accelerate the sampling process. What's more, directly accelerating traditional sampling algorithms will make the structure of the accelerator very complicated. In this work, we made two contributions: (1) Proposed a new neighbor sampler: CONCAT Sampler, which can be easily accelerated on hardware level while guaranteeing the test accuracy. (2) Designed a CONCAT-sampler-accelerator based on FPGA, with which the neighbor sampling process boosted to about 300-1000 times faster compared to the sampling process without it.
Key facts. Cited by 1 paper in the map (data through 14 Oct 2026). Builds on 20 of its 24 references that are in the map. First posted on arXiv 7 Sep 2022.
Builds on
20 of 24 references.
References · 20
- 2016Semi-Supervised Classification with Graph Convolutional Networkscited by 11,361
- 2017Inductive Representation Learning on Large Graphscited by 6,320
- 2019A Comprehensive Survey on Graph Neural Networkscited by 2,919
- 2019Fast Graph Representation Learning with PyTorch Geometriccited by 2,434
- 2020Open Graph Benchmark: Datasets for Machine Learning on Graphscited by 2,163
- 2016Convolutional Neural Networks on Graphs with Fast Localized Spectral Filteringcited by 2,089
- 2013Spectral Networks and Locally Connected Networks on Graphscited by 1,102
- 2015Convolutional Networks on Graphs for Learning Molecular Fingerprintscited by 754
- 2019GraphSAINT: Graph Sampling Based Inductive Learning Methodcited by 618
- 2018FastGCN: Fast Learning with Graph Convolutional Networks via Importance Samplingcited by 584
- 2016Learning Convolutional Neural Networks for Graphscited by 314
- 2018Adaptive Sampling Towards Fast Graph Representation Learningcited by 180
8 more
- 2020Computing Graph Neural Networks: A Survey from Algorithms to Acceleratorscited by 81
- 2020HyGCN: A GCN Accelerator with Hybrid Architecturecited by 74
- 2022TGL: A General Framework for Temporal GNN Training on Billion-Scale Graphscited by 61
- 2020Pre-Training Graph Neural Networks for Cold-Start Users and Items Representationcited by 42
- 2020Bandit Samplers for Training Graph Neural Networkscited by 30
- 2021A Biased Graph Neural Network Sampler with Near-Optimal Regretcited by 17
- 2021GNNSampler: Bridging the Gap between Sampling Algorithms of GNN and Hardwarecited by 6
- 2021Progressive Representative Labeling for Deep Semi-Supervised Learningcited by 3
Built on by
Citing papers per year: 2026: 1.
1 paper.