arXiv Machine Learning September 11, 2026 By Camille Pradel

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

Read the original on arXiv Machine Learning →

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.

Machine-generated by The Flow from the publisher's headline and feed description — not written or checked by a human. The full article lives at arXiv Machine Learning.

benchmarks

arXiv Machine Learning

Jun 17

Half a Link can Be Enough to Predict a Whole Link: Understanding Generalization in Knowledge Graph Foundation Models

arXiv:2606. 18001v1 Announce Type: new Abstract: Knowledge graph (KG) foundation models (KGFMs) are zero-shot generalizers: trained once, they can predict links on unseen graphs without retraining.

By Cosimo Gregucci, Obaidah Theeb, Daniel Hernandez, Antonio Vergari, Steffen Staab

benchmarks

arXiv AI

Oct 19

Path to Prior-Data Fitted Relational Models via Learned Latent Multi-table Representations

The paper investigates whether prior‑data‑fitted networks (PFNs) can be extended to graph‑based relational models. The authors pretrain a message‑passing foundation model, Griffin, on large synthetic relational databases and evaluate its frozen encoder on 16 real‑world relational classification tasks. A curriculum that starts with schema‑guided synthetic data and then uses schema‑agnostic data yields the best in‑context performance, outperforming real‑data‑only pretraining and other mixtures.

By Mohammad Sadeq Abolhasani, Viswanath Ganapathy

llms fine-tuning

Hugging Face Trending Papers

Oct 16

Path to Prior-Data Fitted Relational Models via Learned Latent Multi-table Representations

Prior-data fitted networks (PFNs) show that pretraining on large populations of synthetic tasks can enable generalization to unseen datasets with little or no downstream fine-tuning. This paradigm is...

llms fine-tuning

arXiv Computer Vision

Sep 14

RelateAnything: Real-Time Open-Vocabulary Relation Prediction From Any Inputs

arXiv:2609.12552v1 Announce Type: new Abstract: Open-vocabulary detection accepts any class list at inference, and promptable segmentation returns regions without class names: the taxonomy has left t...

By Ma\"elic Neau

rag computer-vision multimodal benchmarks

arXiv AI

Jun 11

GILT: An LLM-Free, Tuning-Free Graph Foundational Model for In-Context Learning

arXiv:2510. 04567v3 Announce Type: replace-cross Abstract: Graph Neural Networks (GNNs) are powerful tools for processing relational data but often struggle to generalize to unseen graphs, giving rise to the development of Graph Foundational Models (GFMs).

By Weishuo Ma, Yanbo Wang, Xiyuan Wang, Lei Zou, Muhan Zhang

llms

arXiv Machine Learning

Aug 28

Neural Regression with Embeddings for Numerical Attribute Prediction in Knowledge Graphs

The paper introduces LitEm, a neural regression model that allows transductive knowledge graph embedding models to predict numerical attributes. LitEm achieves top or near‑top performance on most attributes across datasets such as FB15K‑237, YAGO15K, DB15K, and Mutagenesis. A co‑training framework further improves link prediction for bilinear models while enabling them to predict numerical attributes, demonstrating literal‑aware encoding of attribute information.

By Rupesh Sapkota, Louis Mozart Kamdem Teyou, Moshood Yekini, Caglar Demir, Axel-Cyrille Ngonga Ngomo

rag benchmarks

One email a morning, machine-written

Related stories

Half a Link can Be Enough to Predict a Whole Link: Understanding Generalization in Knowledge Graph Foundation Models

Path to Prior-Data Fitted Relational Models via Learned Latent Multi-table Representations

Path to Prior-Data Fitted Relational Models via Learned Latent Multi-table Representations

RelateAnything: Real-Time Open-Vocabulary Relation Prediction From Any Inputs

GILT: An LLM-Free, Tuning-Free Graph Foundational Model for In-Context Learning

Neural Regression with Embeddings for Numerical Attribute Prediction in Knowledge Graphs