ARNS: Adaptive Relation-Aware Negative Sampling with Curriculum Learning for Inductive Knowledge Graph Completion
Ling Ding, Zhizhi Yu, Di Jin, Lei Huang
Abstract
Inductive knowledge graph completion (KGC) aims to predict missing links involving unseen entities, making it a particularly challenging task for knowledge representation learning. Traditional embedding-based methods often fall short in this setting due to their limited structural reasoning capabilities. Recently, Graph Neural Networks (GNNs) offer a promising alternative by explicitly modeling the graph topology. However, their performance heavily relies on the quality of negative samples during training, which significantly influences the learned representations and generalization ability. To tackle this issue, we propose Adaptive Relation-Aware Negative Sampling (ARNS), a negative sampling approach specifically tailored for GNN-based inductive KGC. It integrates three key strategies: (1) High-quality negatives via Linear WD for discriminative learning, (2) Relation-aware negatives utilizing relation graphs to preserve structural patterns, as well as (3) Adaptive curriculum learning that dynamically adjusts sampling ratios based on performance feedback. Our key innovation lies in a performance-driven adaptation mechanism that monitors training dynamics and modulates negative sample difficulty. This approach starts with easier samples for stability, and progressively introduces challenging negatives. Experiments demonstrate that ARNS outperforms state-of-the-art methods with significant MRR improvements while maintaining training stability. The adaptive design is particularly beneficial in inductive scenarios, where models can infer structural patterns from limited observations.
Ask about this paper
Your agent reads all of it.
Lune indexed this paper to the last equation, along with the top-tier papers that cite it. Ask a question and the answer quotes them.
Your agent calls
Luneget_paper_fulltext
Free to start. No credit card required.
Terminal
Install the CLIlune papers fulltext 7dd7c4db-3667-4fbc-8d88-61d0cda70599Builds on14
- Composition-based Multi-Relational Graph Convolutional NetworksShikhar Vashishth, Soumya Sanyal, Vikram Nitin, Partha P. TalukdarICLR 2020 · 1,105 citations
- Neural Bellman-Ford Networks: A General Graph Neural Network Framework for Link PredictionZhaocheng Zhu, Zuobai Zhang, Louis-Pascal A. C. Xhonneux, Jian TangNeurIPS 2021 · 546 citations
- Inductive Relation Prediction by Subgraph ReasoningKomal K. Teru, Etienne G. Denis, William L. HamiltonICML 2020 · 493 citations
- Knowledge Graph Reasoning with Relational DigraphYongqi Zhang, Quanming YaoWWW 2022 · 193 citations
- Topology-Aware Correlations Between Relations for Inductive Link Prediction in Knowledge GraphsJiajun Chen, Huarui He, Feng Wu, Jie WangAAAI 2021 · 161 citations
Related papers
- DANS-KGC: Diffusion Based Adaptive Negative Sampling for Knowledge Graph CompletionHaoning Li, Qinghua HuangAAAI 2026
- Relation-aware Graph Attention Model with Adaptive Self-adversarial TrainingXiao Qin, Nasrullah Sheikh, Berthold Reinwald, Lingfei WuAAAI 2021 · 39 citations
- Relation-enhanced Negative Sampling for Multimodal Knowledge Graph CompletionDerong Xu, Tong Xu, Shiwei Wu, Jingbo Zhou et al.ACM MM 2022 · 89 citations
- Multimodal Knowledge Graph Completion via Relation-Aware Negative Sampling with Diffusion-based InterpolationQian Ma, Linfei Dai, Zhongming Yao, Yu Gu et al.VLDB 2026
- INDIGO: GNN-Based Inductive Knowledge Graph Completion Using Pair-Wise EncodingShuwen Liu, Bernardo Cuenca Grau, Ian Horrocks, Egor V. KostylevNeurIPS 2021 · 128 citations
