Boosting Knowledge Graph Foundation Models via Enhanced Negative Sampling
Not on the map. Why?
Abstract (arXiv)
Knowledge graphs (KGs) have become the core backbone of numerous downstream tasks such as question answering and recommender systems. However, despite all this, KGs are often very incomplete. To perform zero-shot knowledge graph completion in unseen KGs, which have different relational vocabularies from those used for pre-training, KG foundation models (KGFMs) receive a wide range of attention. Existing KGFMs often perform training using random negative triples, which are constructed by replacing the head or tail entity of a positive triple with a random entity. However, these negative triples are often constructed with limited quality, providing weak supervision for KGFM training. In this paper, we propose a simple yet effective adaptive negative sampling approach, KMAS, to enhance existing KGFMs. KMAS constructs hard negative triples through the updated relation embeddings generated from the existing KGFM's relation encoder. To further adaptively align with the evolving capability of the KGFM during the training process, KMAS adjusts the ratio of hard negative triples dynamically throughout the whole training process: after a warmup phrase, it increases the ratio linearly and then decreases linearly. Extensive experiments are conducted over 44 data sets. Experimental results demonstrate that our proposed negative sampling method can enhance many SOTA KGFMs without requiring excessive additional time or memory consumption.
Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 30 of its 54 references that are in the map. First posted on arXiv 26 May 2026.
Builds on
30 of 54 references.
References · 30
- 2019RotatE: Knowledge Graph Embedding by Relational Rotation in Complex Spacecited by 898
- 2017Convolutional 2D Knowledge Graph Embeddingscited by 730
- 2023Unifying Large Language Models and Knowledge Graphs: A Roadmapcited by 668
- 2019KGAT: Knowledge Graph Attention Network for Recommendationcited by 343
- 2021Neural Bellman-Ford Networks: A General Graph Neural Network Framework for Link Predictioncited by 275
- 2017DeepPath: A Reinforcement Learning Method for Knowledge Graph Reasoningcited by 266
- 2019Inductive Relation Prediction by Subgraph Reasoningcited by 239
- 2020CoDEx: A Comprehensive Knowledge Graph Completion Benchmarkcited by 102
- 2022SimKGC: Simple Contrastive Knowledge Graph Completion with Pre-trained Language Modelscited by 91
- 2023Towards Foundation Models for Knowledge Graph Reasoningcited by 86
- 2019Iteratively Learning Embeddings and Rules for Knowledge Graph Reasoningcited by 63
- 2023InGram: Inductive Knowledge Graph Embedding via Relation Graphscited by 52
18 more
- 2017Knowledge Graph Embedding with Iterative Guidance from Soft Rulescited by 51
- 2018NSCaching: Simple and Efficient Negative Sampling for Knowledge Graph Embeddingcited by 42
- 2020Dynamic Anticipation and Completion for Multi-Hop Reasoning over Sparse Knowledge Graphcited by 26
- 2022An Open Challenge for Inductive Link Prediction on Knowledge Graphscited by 26
- 2023A Multi-Task Perspective for Link Prediction with New Relation Types and Nodescited by 24
- 2025TRIX: A More Expressive Model for Zero-shot Domain Transfer in Knowledge Graphscited by 24
- 2025How Expressive are Knowledge Graph Foundation Models?cited by 23
- 2025Is Your Paper Being Reviewed by an LLM? Benchmarking AI Text Detection in Peer Reviewcited by 21
- 2024ONEBench to Test Them All: Sample-Level Benchmarking Over Open-Ended Capabilitiescited by 15
- 2024Improving Complex Reasoning over Knowledge Graph with Logic-Aware Curriculum Tuningcited by 10
- 2025Flock: A Knowledge Graph Foundation Model via Learning on Random Walkscited by 9
- 2025SEMMA: A Semantic Aware Knowledge Graph Foundation Modelcited by 8
- 2024Towards Graph Foundation Models: Training on Knowledge Graphs Enables Transferability to General Graphscited by 6
- 2022Joint Open Knowledge Base Canonicalization and Linkingcited by 5
- 2024Subgraph-Aware Training of Language Models for Knowledge Graph Completion Using Structure-Aware Contrastive Learningcited by 4
- 2024eXpath: Explaining Knowledge Graph Link Prediction with Ontological Closed Path Rulescited by 2
- 2025DANS-KGC: Diffusion Based Adaptive Negative Sampling for Knowledge Graph Completioncited by 1
- 2026Joint Knowledge Base Completion and Question Answering by Combining Large Language Models and Small Language Modelscited by 1
Built on by
Not cited yet.