GE 2 : A General and Efficient Knowledge Graph Embedding Learning System
Open Access
- 29 May 2024
- journal article
- research article
- Published by Association for Computing Machinery (ACM) in Proceedings of the ACM on Management of Data
- Vol. 2 (3) , 1-27
Abstract
Graph embedding learning computes an embedding vector for each node in a graph and finds many applications in areas such as social networks, e-commerce, and medicine. We observe that existing graph embedding systems (e.g., PBG, DGL-KE, and Marius) have long CPU time and high CPU-GPU communication overhead, especially when using multiple GPUs. Moreover, it is cumbersome to implement negative sampling algorithms on them, which have many variants and are crucial for model quality. We propose a new system called GE 2 , which achieves both generality and efficiency for graph embedding learning. In particular, we propose a general execution model that encompasses various negative sampling algorithms. Based on the execution model, we design a user-friendly API that allows users to easily express negative sampling algorithms. To support efficient training, we offload operations from CPU to GPU to enjoy high parallelism and reduce CPU time. We also design COVER, which, to our knowledge, is the first algorithm to manage data swap between CPU and multiple GPUs for small communication costs. Extensive experimental results show that, comparing with the state-of-the-art graph embedding systems, GE 2 trains consistently faster across different models and datasets, where the speedup is usually over 2x and can be up to 7.5x.Keywords
Funding Information
- The Research Matching Grant Scheme (RMGS) of Hong Kong (8601594)
- the University Grants Committee of Hong Kong (8601625)
This publication has 45 references indexed in Scilit:
- Region or Global A Principle for Negative Sampling in Graph-based RecommendationIEEE Transactions on Knowledge and Data Engineering, 2022
- Community Detection in General Hypergraph Via Graph EmbeddingJournal of the American Statistical Association, 2022
- Noise-Contrastive Estimation for Answer Selection with Deep Neural Networks2016
- Structural Deep Network Embedding2016
- node2vec2016
- LINE2015
- DeepWalk2014
- Optimizing top-n collaborative filtering via dynamic negative item sampling2013
- One-Class Collaborative Filtering2008
- On resolvable designsDiscrete Mathematics, 1972