mlsanityData to 7 Oct 2026

GraphScale: A Framework to Enable Machine Learning over Billion-node Graphs

arXiv 2407.15452 ↗First posted 22 Jul 2024cs.LG cs.DC cs.SIcited by 4

Not on the map. Why?

Abstract (arXiv)

Graph Neural Networks (GNNs) have emerged as powerful tools for supervised machine learning over graph-structured data, while sampling-based node representation learning is widely utilized in unsupervised learning. However, scalability remains a major challenge in both supervised and unsupervised learning for large graphs (e.g., those with over 1 billion nodes). The scalability bottleneck largely stems from the mini-batch sampling phase in GNNs and the random walk sampling phase in unsupervised methods. These processes often require storing features or embeddings in memory. In the context of distributed training, they require frequent, inefficient random access to data stored across different workers. Such repeated inter-worker communication for each mini-batch leads to high communication overhead and computational inefficiency. We propose GraphScale, a unified framework for both supervised and unsupervised learning to store and process large graph data distributedly. The key insight in our design is the separation of workers who store data and those who perform the training. This separation allows us to decouple computing and storage in graph training, thus effectively building a pipeline where data fetching and data computation can overlap asynchronously. Our experiments show that GraphScale outperforms state-of-the-art methods for distributed training of both GNNs and node embeddings. We evaluate GraphScale both on public and proprietary graph datasets and observe a reduction of at least 40% in end-to-end training times compared to popular distributed frameworks, without any loss in performance. While most existing methods don't support billion-node graphs for training node embeddings, GraphScale is currently deployed in production at TikTok enabling efficient learning over such large graphs.

Key facts. Cited by 4 papers in the map (data through 7 Oct 2026). Builds on 21 of its 43 references that are in the map. First posted on arXiv 22 Jul 2024.

Builds on

21 of 43 references.

References · 21

  1. 2014Adam: A Method for Stochastic Optimizationcited by 36,960
  2. 2016node2vec: Scalable Feature Learning for Networkscited by 1,913
  3. 2018Graph Neural Networks: A Review of Methods and Applicationscited by 1,571
  4. 2014DeepWalk: Online Learning of Social Representationscited by 1,543
  5. 2018Graph Convolutional Neural Networks for Web-Scale Recommender Systemscited by 1,133
  6. 2015LINE: Large-scale Information Network Embeddingcited by 582
  7. 2017Network Embedding as Matrix Factorization: Unifying DeepWalk, LINE, PTE, and node2veccited by 197
  8. 2019AliGraph: A Comprehensive Graph Neural Network Platformcited by 152
  9. 2017Predicting multicellular function through multi-layer tissue networkscited by 138
  10. 2019PyTorch-BigGraph: A Large-scale Graph Embedding Systemcited by 118
  11. 2018Billion-scale Commodity Embedding for E-commerce Recommendation in Alibabacited by 105
  12. 2021TT-Rec: Tensor Train Compression for Deep Learning Recommendation Modelscited by 58
9 more
  1. 2021Accelerating Training and Inference of Graph Neural Networks with Fast Sampling and Pipeliningcited by 39
  2. 2020Accelerating Graph Sampling for Graph Machine Learning using GPUscited by 29
  3. 2021Global Neighbor Sampling for Mixed CPU-GPU Training on Giant Graphscited by 22
  4. 2020InfiniteWalk: Deep Network Embeddings as Laplacian Embeddings with a Nonlinearitycited by 19
  5. 2019A Comparative Study for Unsupervised Network Representation Learningcited by 16
  6. 2020Training Recommender Systems at Scale: Communication-Efficient Model and Data Parallelismcited by 15
  7. 2021A Broader Picture of Random-walk Based Graph Embeddingcited by 15
  8. 2018Theoretically Efficient Parallel Graph Algorithms Can Be Fast and Scalablecited by 6
  9. 2022Nimble GNN Embedding with Tensor-Train Decompositioncited by 6

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2025: 2; 2026: 2.

4 papers.