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.
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.
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).
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.
arXiv:2607. 11374v1 Announce Type: new Abstract: Graph Foundation Models (GFMs) have emerged as a promising paradigm for learning transferable representations across diverse graph domains.
arXiv:2605. 15511v2 Announce Type: replace Abstract: Graph Neural Networks (GNNs) have become the dominant framework for inductive graph-level learning.
arXiv:2606. 16509v1 Announce Type: new Abstract: Link prediction in knowledge graphs fundamentally depends on the quality of learned embeddings for entities and relations.
arXiv:2606. 06397v1 Announce Type: new Abstract: Current evaluation practices in relational learning rely heavily on flat leaderboards that average performance across heterogeneous datasets, implicitly assuming a uniform underlying structure.
arXiv:2608. 11431v1 Announce Type: new Abstract: Graph learning presupposes a graph, and tables and relational databases do not come with one.
MUGEN is a framework that generates unlearnable graph examples capable of protecting multiple downstream tasks—node classification, graph classification, and link prediction—simultaneously. It achieves this by perturbing a single clean dataset with a shared GNN encoder and task‑specific heads, guided by a Task‑Aligned Separability Objective (TASO) and a Type‑Adaptive Perturbation (TAP) that handles both discrete and continuous node attributes. Experiments on five benchmarks, four GNN backbones, and three learning paradigms show that MUGEN’s perturbations transfer across models and remain effective even under adversarial training and data augmentation.
arXiv:2603. 07523v3 Announce Type: replace Abstract: Transferring knowledge by fine-tuning large-scale pre-trained networks has become a standard paradigm for downstream tasks, yet the knowledge of a pre-trained model is tightly coupled with monolithic architecture, which restricts flexible reuse across models of varying scales.
arXiv:2509. 21489v4 Announce Type: replace Abstract: Graph foundation models face several fundamental challenges including transferability across diverse domains and data scarcity, which calls into question the very feasibility of creating such models.
KGFR introduces a Knowledge Graph Foundation Retriever that collaborates with large language models to enhance knowledge‑intensive question answering. By encoding relations with LLM‑generated descriptions and initializing entities from question roles, KGFR enables zero‑shot generalization to unseen knowledge graphs. Its Asymmetric Progressive Propagation technique efficiently handles large graphs, while a controllable reasoning loop allows the LLM to request candidate answers, supporting facts, and reasoning paths.