The paper introduces a method that transforms knowledge graph facts into a fixed vocabulary representation, where each fact becomes a node linked to its subject, object, and relation type via six meta-relations. Using this representation, standard GNNs (e.g., GAT, GINE, GraphSAGE, R-GCN) trained on a single small graph can achieve zero‑shot link prediction on 40 inductive benchmarks, matching the performance of specialized foundation models like ULTRA. The approach also generalizes to relational databases, enabling foreign‑key prediction without cell values or schema text, and the authors provide code, checkpoints, and evaluation tools for all benchmarks.
By Camille Pradel
arXiv:2606. 03365v1 Announce Type: new Abstract: Embedding models (KGEMs) constitute the main link prediction approach to complete knowledge graphs.
By Guillaume M\'erou\'e, Fabien Gandon, Pierre Monnin
arXiv:2609. 03487v1 Announce Type: cross Abstract: Knowledge graph embedding (KGE) demonstrates its effectiveness for predicting missing links in knowledge graphs (KGs) by projecting entities and relations into a low-dimensional vector space.
By Junsik Kim, Kangil Kim
The paper introduces ImbalancE, an inference‑time latent search method that mitigates degree imbalance bias in Knowledge Graph Embedding models. It targets the problematic prediction of target entities with much lower degrees than anchor entities, a common issue in recommender systems and other applications. Experiments on benchmark datasets show that ImbalancE improves predictions on the most imbalanced triples compared to conventional methods.
By Alberto Bernardi, Luca Costabello, Christophe Gueret
arXiv:2606. 03307v1 Announce Type: cross Abstract: Graph foundation models (GFMs) emerged as a dominant paradigm in graph representation learning by leveraging large-scale pre-training for cross-domain inference.
By Yifan Jin, Qirui Ji, Bin Qin, Jiangmeng Li, Lixiang Liu, Fuchun Sun, Changwen Zheng
The paper investigates how different link prediction models for knowledge graphs produce varying predictions and explores the extent of their complementary knowledge. By evaluating an oracle that selects the best prediction from a set of models, the authors show a significant performance gap between individual models and the oracle, indicating substantial complementarity. However, this complementarity quickly saturates as more models are added, leaving many queries unsolved even with many models.
By Guillaume M\'erou\'e, Fabien Gandon, Pierre Monnin