An LLM-Guided Query-Aware Inference System for GNN Models on Large Knowledge Graphs
Not on the map. Why?
Abstract (arXiv)
Efficient inference for graph neural networks (GNNs) on large knowledge graphs (KGs) is essential for many real-world applications. GNN inference queries are computationally expensive and vary in complexity, as each involves a different number of target nodes linked to subgraphs of diverse densities and structures. Existing acceleration methods, such as pruning, quantization, and knowledge distillation, instantiate smaller models but do not adapt them to the structure or semantics of individual queries. They also store models as monolithic files that must be fully loaded, and miss the opportunity to retrieve only the neighboring nodes and corresponding model components that are semantically relevant to the target nodes. These limitations lead to excessive data loading and redundant computation on large KGs. This paper presents KG-WISE, a task-driven inference paradigm for large KGs. KG-WISE decomposes trained GNN models into fine-grained components that can be partially loaded based on the structure of the queried subgraph. It employs large language models (LLMs) to generate reusable query templates that extract semantically relevant subgraphs for each task, enabling query-aware and compact model instantiation. We evaluate KG-WISE on six large KGs with up to 42 million nodes and 166 million edges. KG-WISE achieves up to 28x faster inference and 98% lower memory usage than state-of-the-art systems while maintaining or improving accuracy across both commercial and open-weight LLMs.
Key facts. Cited by 2 papers in the map (data through 7 Oct 2026). Builds on 23 of its 42 references that are in the map. First posted on arXiv 4 Mar 2026.
Builds on
23 of 42 references.
References · 23
- 2017Inductive Representation Learning on Large Graphscited by 6,284
- 2020Open Graph Benchmark: Datasets for Machine Learning on Graphscited by 2,148
- 2017Modeling Relational Data with Graph Convolutional Networkscited by 1,684
- 2017Convolutional 2D Knowledge Graph Embeddingscited by 729
- 2019GraphSAINT: Graph Sampling Based Inductive Learning Methodcited by 618
- 2019Measuring and Relieving the Over-smoothing Problem for Graph Neural Networks from the Topological Viewcited by 544
- 2020Graph Neural Networks in Recommender Systems: A Surveycited by 493
- 2024The Faiss librarycited by 370
- 2020Enhancing Graph Neural Network-based Fraud Detectors against Camouflaged Fraudsterscited by 248
- 2021Graph-less Neural Networks: Teaching Old MLPs New Tricks via Distillationcited by 151
- 2020DistDGL: Distributed Graph Neural Network Training for Billion-Scale Graphscited by 139
- 2022Decoupling the Depth and Scope of Graph Neural Networkscited by 94
11 more
- 2020Degree-Quant: Quantization-Aware Training for Graph Neural Networkscited by 93
- 2022Simple and Efficient Heterogeneous Graph Neural Networkcited by 71
- 2021Accelerating Large Scale Real-Time GNN Inference using Channel Pruningcited by 41
- 2021Meta-Knowledge Transfer for Inductive Knowledge Graph Embeddingcited by 31
- 2021Early-Bird GCNs: Graph-Network Co-Optimization Towards More Efficient GCN Training and Inference via Drawing Early-Bird Lottery Ticketscited by 27
- 2020SGQuant: Squeezing the Last Bit on Graph Neural Networks with Specialized Quantizationcited by 25
- 2022Geometric Knowledge Distillation: Topology Compression for Graph Neural Networkscited by 22
- 2024Anomaly Detection in Dynamic Graphs: A Comprehensive Surveycited by 18
- 2022Influence-Based Mini-Batching for Graph Neural Networkscited by 15
- 2021Edge: Enriching Knowledge Graph Embeddings with External Textcited by 13
- 2024Task-Oriented GNNs Training on Large Knowledge Graphs for Accurate and Efficient Modelingcited by 5
Built on by
Citing papers per year: 2026: 2.
2 papers.