gHAWK: Local and Global Structure Encoding for Scalable Training of Graph Neural Networks on Knowledge Graphs
Humera Sabir, Fatima Farooq, Ashraf Aboulnaga

TL;DR
gHAWK introduces a scalable GNN training framework for large knowledge graphs by precomputing local and global structural features, significantly improving efficiency and accuracy over existing methods.
Contribution
The paper presents gHAWK, a novel approach that precomputes local and global graph features to enable scalable and efficient GNN training on large knowledge graphs.
Findings
Achieves state-of-the-art accuracy on large datasets.
Reduces training time compared to traditional GNNs.
Improves model performance by incorporating structural priors.
Abstract
Knowledge Graphs (KGs) are a rich source of structured, heterogeneous data, powering a wide range of applications. A common approach to leverage this data is to train a graph neural network (GNN) on the KG. However, existing message-passing GNNs struggle to scale to large KGs because they rely on the iterative message passing process to learn the graph structure, which is inefficient, especially under mini-batch training, where a node sees only a partial view of its neighborhood. In this paper, we address this problem and present gHAWK, a novel and scalable GNN training framework for large KGs. The key idea is to precompute structural features for each node that capture its local and global structure before GNN training even begins. Specifically, gHAWK introduces a preprocessing step that computes: (a)~Bloom filters to compactly encode local neighborhood structure, and (b)~TransE…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Graph Neural Networks · Graph Theory and Algorithms · Machine Learning in Healthcare
