BiFeat: Supercharge GNN Training via Graph Feature Quantization
Not on the map. Why?
Abstract (arXiv)
Graph Neural Networks (GNNs) is a promising approach for applications with nonEuclidean data. However, training GNNs on large scale graphs with hundreds of millions nodes is both resource and time consuming. Different from DNNs, GNNs usually have larger memory footprints, and thus the GPU memory capacity and PCIe bandwidth are the main resource bottlenecks in GNN training. To address this problem, we present BiFeat: a graph feature quantization methodology to accelerate GNN training by significantly reducing the memory footprint and PCIe bandwidth requirement so that GNNs can take full advantage of GPU computing capabilities. Our key insight is that unlike DNN, GNN is less prone to the information loss of input features caused by quantization. We identify the main accuracy impact factors in graph feature quantization and theoretically prove that BiFeat training converges to a network where the loss is within ε of the optimal loss of uncompressed network. We perform extensive evaluation of BiFeat using several popular GNN models and datasets, including GraphSAGE on MAG240M, the largest public graph dataset. The results demonstrate that BiFeat achieves a compression ratio of more than 30 and improves GNN training speed by 200%-320% with marginal accuracy loss. In particular, BiFeat achieves a record by training GraphSAGE on MAG240M within one hour using only four GPUs.
Key facts. Cited by 4 papers in the map (data through 14 Oct 2026). Builds on 28 of its 49 references that are in the map. First posted on arXiv 29 Jul 2022.
Builds on
28 of 49 references.
References · 28
- 2018BERT: Pre-training of Deep Bidirectional Transformers for Language Understandingcited by 40,399
- 2016Semi-Supervised Classification with Graph Convolutional Networkscited by 11,361
- 2017Graph Attention Networkscited by 8,923
- 2017Inductive Representation Learning on Large Graphscited by 6,320
- 2018How Powerful are Graph Neural Networks?cited by 4,393
- 2019Fast Graph Representation Learning with PyTorch Geometriccited by 2,434
- 2020Open Graph Benchmark: Datasets for Machine Learning on Graphscited by 2,163
- 2020Simple and Deep Graph Convolutional Networkscited by 860
- 2018A Convergence Theory for Deep Learning via Over-Parameterizationcited by 787
- 2018FastGCN: Fast Learning with Graph Convolutional Networks via Importance Samplingcited by 584
- 2019Cluster-GCN: An Efficient Algorithm for Training Deep and Large Graph Convolutional Networkscited by 541
- 2017Deep Gradient Compression: Reducing the Communication Bandwidth for Distributed Trainingcited by 478
16 more
- 2017Deep Gaussian Embedding of Graphs: Unsupervised Inductive Learning via Rankingcited by 335
- 2020GPT-GNN: Generative Pre-Training of Graph Neural Networkscited by 303
- 2020Towards Deeper Graph Neural Networkscited by 296
- 2017TernGrad: Ternary Gradients to Reduce Communication in Distributed Deep Learningcited by 256
- 2017Sparse Communication for Distributed Gradient Descentcited by 249
- 2020Degree-Quant: Quantization-Aware Training for Graph Neural Networkscited by 96
- 2021GNNAutoScale: Scalable and Expressive Graph Neural Networks via Historical Embeddingscited by 90
- 2019Cross-lingual Knowledge Graph Alignment via Graph Matching Neural Networkcited by 68
- 2019Convergence of Adversarial Training in Overparametrized Neural Networkscited by 58
- 2018Beyond One-hot Encoding: lower dimensional target embeddingcited by 43
- 2018Bi-Real Net: Binarizing Deep Network Towards Real-Network Performancecited by 42
- 2021VQ-GNN: A Universal Framework to Scale up Graph Neural Networks using Vector Quantizationcited by 39
- 2020Binary Graph Neural Networkscited by 34
- 2020SGQuant: Squeezing the Last Bit on Graph Neural Networks with Specialized Quantizationcited by 27
- 2021Global Neighbor Sampling for Mixed CPU-GPU Training on Giant Graphscited by 22
- 2020Progressive Graph Convolutional Networks for Semi-Supervised Node Classificationcited by 2
Built on by
Citing papers per year: 2023: 2; 2024: 1; 2025: 0; 2026: 1.
4 papers.
- 2023Graph Meets LLMs: Towards Large Graph Modelscited by 20
- 2023LazyGNN: Large-Scale Graph Neural Networks via Lazy Propagationcited by 16
- 2024Distributed Training of Large Graph Neural Networks with Variable Communication Ratescited by 0
- 2026Reducing the GPU Memory Bottleneck with Lossless Compression for ML -- Extendedcited by 0
- 2026Reducing the GPU Memory Bottleneck with Lossless Compression for ML -- Extended29 May 2026
- 2024Distributed Training of Large Graph Neural Networks with Variable Communication Rates25 Jun 2024
- 2023Graph Meets LLMs: Towards Large Graph Models28 Aug 2023
- 2023LazyGNN: Large-Scale Graph Neural Networks via Lazy Propagation3 Feb 2023
Similar, not cited
Close in wording, no citation either way
- 2023Tango: rethinking quantization for graph neural network training on GPUs
- 2024Scaling Large-scale GNN Training to Thousands of Processors on CPU-based Supercomputers ↗
- 2023MEGA: A Memory-Efficient GNN Accelerator Exploiting Degree-Aware Mixed-Precision Quantization
- 2023Low-bit Quantization for Deep Graph Neural Networks with Smoothness-aware Message Propagation
- 2023Boosting Distributed Full-graph GNN Training with Asynchronous One-bit Communication
- 2023rm A2Q: Aggregation-Aware Quantization for Graph Neural Networks
- 2021QGTC: Accelerating Quantized Graph Neural Networks via GPU Tensor Core
- 2023Adaptive Message Quantization and Parallelization for Distributed Full-graph GNN Training