Reification as a Transferable Vocabulary: Zero-Shot Link Prediction with Vanilla GNNs

• URL: http://arxiv.org/abs/2609.11347v1
• Date: Thu, 10 Sep 2026 10:26:09 GMT
• Title: Reification as a Transferable Vocabulary: Zero-Shot Link Prediction with Vanilla GNNs
• Abstract summary: Knowledge graph foundation models such as ULTRA achieve zero-shot link prediction on unseen graphs through dedicated architectures that hard-code a transfer mechanism.<n>In this work we move that mechanism out of the architecture and into the representation, by emphreifying the input graph.<n>Five textbook GNNs each trained on a single knowledge graph of 4,245 triples for 30 minutes on one NVIDIA A100, transfer zero-shot to 40 inductive link-prediction benchmarks.
• Score: 0.033842793760651545
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Knowledge graph foundation models such as ULTRA achieve zero-shot link prediction on unseen graphs through dedicated architectures that hard-code a transfer mechanism. In this work we move that mechanism out of the architecture and into the representation, by \emph{reifying} the input graph: every fact becomes a node, connected to its subject, object, and relation type through a fixed vocabulary of six meta-relations, with relation types as anonymous shared nodes rather than model parameters. On this representation, five textbook GNNs (GAT, GINE with sum and with mean+max aggregation, GraphSAGE, R-GCN), each trained on a single knowledge graph of 4,245 triples for 30 minutes on one NVIDIA A100, transfer zero-shot to 40 inductive link-prediction benchmarks. The best of them, an off-the-shelf GAT, matches ULTRA, a dedicated foundation model pretrained on three graphs, across ULTRA's own evaluation suite. The same fixed vocabulary extends to relational databases, a row becoming an entity and a foreign-key column a relation type; a preliminary probe on two unseen databases, with no cell values, schema text or in-context labels, shows a model of this family pretrained on three knowledge graphs ranking foreign-key targets far above random-initialization and degree controls. We release the code, the checkpoints, and the evaluation pipeline for all 40 benchmarks.

Related papers

• Learning Chain Of Thoughts Prompts for Predicting Entities, Relations, and even Literals on Knowledge Graphs [8.176236109014758]
  We introduce RALP, which learns string-based chain-of-thought prompts as scoring functions for triples.<n>At inference, RALP predicts missing entities, relations or whole triples and assigns confidence scores based on the learned prompt.<n>We release our implementation, training, and evaluation pipeline as open source.
  arXiv  Detail & Related papers  (2026-04-14T12:21:15Z)
• CGLE: Class-label Graph Link Estimator for Link Prediction [10.111824396356543]
  CGLE (Class-label Graph Link Estimator) is a novel framework designed to augment GNN-based link prediction models.<n>CGLE operates by constructing a class-conditioned link probability matrix.<n>It is encapsulated in an efficient preprocessing stage, leaving the computational complexity of the underlying GNN model unaffected.
  arXiv  Detail & Related papers  (2025-11-10T11:34:36Z)
• Context Pooling: Query-specific Graph Pooling for Generic Inductive Link Prediction in Knowledge Graphs [55.918039693545616]
  We introduce a novel method, named Context Pooling, to enhance GNN-based models' efficacy for link predictions in Knowledge Graphs.<n>Our method is generic and assessed by being applied to two state-of-the-art (SOTA) models on three public transductive and inductive datasets.
  arXiv  Detail & Related papers  (2025-07-10T09:54:37Z)
• GraphBridge: Towards Arbitrary Transfer Learning in GNNs [65.01790632978962]
  GraphBridge is a novel framework to enable knowledge transfer across disparate tasks and domains in GNNs.<n>It allows for the augmentation of any pre-trained GNN with prediction heads and a bridging network that connects the input to the output layer.<n> Empirical validation, conducted over 16 datasets representative of these scenarios, confirms the framework's capacity for task- and domain-agnostic transfer learning.
  arXiv  Detail & Related papers  (2025-02-26T15:57:51Z)
• RelGNN: Composite Message Passing for Relational Deep Learning [56.48834369525997]
  We introduce RelGNN, a novel GNN framework specifically designed to leverage the unique structural characteristics of the graphs built from relational databases.<n>RelGNN is evaluated on 30 diverse real-world tasks from Relbench (Fey et al., 2024), and achieves state-of-the-art performance on the vast majority tasks, with improvements of up to 25%.
  arXiv  Detail & Related papers  (2025-02-10T18:58:40Z)
• An Automatic Graph Construction Framework based on Large Language Models for Recommendation [49.51799417575638]
  We introduce AutoGraph, an automatic graph construction framework based on large language models for recommendation.<n>LLMs infer the user preference and item knowledge, which is encoded as semantic vectors.<n>Latent factors are incorporated as extra nodes to link the user/item nodes, resulting in a graph with in-depth global-view semantics.
  arXiv  Detail & Related papers  (2024-12-24T07:51:29Z)
• MUSE: Integrating Multi-Knowledge for Knowledge Graph Completion [0.0]
  Knowledge Graph Completion (KGC) aims to predict the missing [relation] part (head entity)--[relation]->(tail entity) triplet. Most existing KGC methods focus on single features (e.g., relation types) or sub-graph aggregation. We propose a knowledge-aware reasoning model (MUSE) which designs a novel multi-knowledge representation learning mechanism for missing relation prediction.
  arXiv  Detail & Related papers  (2024-09-26T04:48:20Z)
• Towards Better Graph-based Cross-document Relation Extraction via Non-bridge Entity Enhancement and Prediction Debiasing [30.204313638661255]
  Cross-document Relation Extraction aims to predict the relation between target entities located in different documents. We propose a novel graph-based cross-document RE model with non-bridge entity enhancement and prediction debiasing.
  arXiv  Detail & Related papers  (2024-06-24T11:08:28Z)
• IntelliGraphs: Datasets for Benchmarking Knowledge Graph Generation [2.4810855804075946]
  We introduce the subgraph inference task, where a model has to generate likely and semantically valid subgraphs. IntelliGraphs datasets contain subgraphs with semantics expressed in logical rules for evaluating subgraph inference.
  arXiv  Detail & Related papers  (2023-07-13T11:54:32Z)
• On Exploring Node-feature and Graph-structure Diversities for Node Drop Graph Pooling [86.65151066870739]
  Current node drop pooling methods ignore the graph diversity in terms of the node features and the graph structures, thus resulting in suboptimal graph-level representations. We propose a novel plug-and-play score scheme and refer to it as MID, which consists of a textbfMulti score space with two operations, textiti.e., fltextbfIpscore and textbfDropscore. Specifically, the multidimensional score space depicts the significance of nodes through multiple criteria; the flipscore encourages the maintenance of dissimilar node
  arXiv  Detail & Related papers  (2023-06-22T08:02:01Z)
• GraphFormers: GNN-nested Transformers for Representation Learning on Textual Graph [53.70520466556453]
  We propose GraphFormers, where layerwise GNN components are nested alongside the transformer blocks of language models. With the proposed architecture, the text encoding and the graph aggregation are fused into an iterative workflow. In addition, a progressive learning strategy is introduced, where the model is successively trained on manipulated data and original data to reinforce its capability of integrating information on graph.
  arXiv  Detail & Related papers  (2021-05-06T12:20:41Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.