LPS-GNN : Deploying Graph Neural Networks on Graphs with 100-Billion Edges
arXiv:2507.14570 · doi:10.1145/3801100
Abstract
Graph Neural Networks (GNNs) have emerged as powerful tools for various graph mining tasks, yet existing scalable solutions often struggle to balance execution efficiency with prediction accuracy. These difficulties stem from iterative message-passing techniques, which place significant computational demands and require extensive GPU memory, particularly when dealing with the neighbor explosion issue inherent in large-scale graphs. This paper introduces a scalable, low-cost, flexible, and efficient GNN framework called LPS-GNN, which can perform representation learning on 100 billion graphs with a single GPU in 10 hours and shows a 13.8% improvement in User Acquisition scenarios. We examine existing graph partitioning methods and design a superior graph partition algorithm named LPMetis. In particular, LPMetis outperforms current state-of-the-art (SOTA) approaches on various evaluation metrics. In addition, our paper proposes a subgraph augmentation strategy to enhance the model's predictive performance. It exhibits excellent compatibility, allowing the entire framework to accommodate various GNN algorithms. Successfully deployed on the Tencent platform, LPS-GNN has been tested on public and real-world datasets, achieving performance lifts of 8. 24% to 13. 89% over SOTA models in online applications.
References in corpus (10)
- XGBoost: A Scalable Tree Boosting System
- Fast unfolding of communities in large networks
- Graph Convolutional Neural Networks for Web-Scale Recommender Systems
- Enhancing Graph Neural Network-based Fraud Detectors against Camouflaged Fraudsters
- Scaling Graph Neural Networks with Approximate PageRank
- Ginex: SSD-enabled Billion-scale Graph Neural Network Training on a Single Machine via Provably Optimal In-memory Caching
- Network community detection using modularity density measures
- Hypergraph Partitioning With Embeddings
- Distributed Hybrid CPU and GPU training for Graph Neural Networks on Billion-Scale Graphs
- Graph Attention MLP with Reliable Label Utilization