TL;DR
This paper introduces a retrieve-and-read framework for knowledge graph link prediction that improves efficiency and accuracy by focusing on relevant subgraphs and employing a Transformer-based GNN reader.
Contribution
It proposes a novel framework that retrieves relevant subgraphs and uses a Transformer-based GNN for joint reasoning, addressing limitations of traditional GNNs.
Findings
Competitive performance on standard datasets
Effective focus on salient context information
Insights for designing better retrievers
Abstract
Knowledge graph (KG) link prediction aims to infer new facts based on existing facts in the KG. Recent studies have shown that using the graph neighborhood of a node via graph neural networks (GNNs) provides more useful information compared to just using the query information. Conventional GNNs for KG link prediction follow the standard message-passing paradigm on the entire KG, which leads to superfluous computation, over-smoothing of node representations, and also limits their expressive power. On a large scale, it becomes computationally expensive to aggregate useful information from the entire KG for inference. To address the limitations of existing KG link prediction frameworks, we propose a novel retrieve-and-read framework, which first retrieves a relevant subgraph context for the query and then jointly reasons over the context and the query with a high-capacity reader. As part…
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.
Code & Models
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
