ARNS: Adaptive Relation-Aware Negative Sampling with Curriculum Learning for Inductive Knowledge Graph Completion
Ling Ding, Zhizhi Yu, Di Jin, Lei Huang
摘要
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.
问问这篇 Paper
智能体会读完全文。
Lune 把这篇 Paper 索引到了每一个公式,引用它的顶会 Paper 也一样。你提问,回答直接引用原文。
它引用的顶会 Paper14
- Composition-based Multi-Relational Graph Convolutional NetworksShikhar Vashishth, Soumya Sanyal, Vikram Nitin, Partha P. TalukdarICLR 2020 · 被引用 1,105 次
- 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 次
- Inductive Relation Prediction by Subgraph ReasoningKomal K. Teru, Etienne G. Denis, William L. HamiltonICML 2020 · 被引用 493 次
- Knowledge Graph Reasoning with Relational DigraphYongqi Zhang, Quanming YaoWWW 2022 · 被引用 193 次
- Topology-Aware Correlations Between Relations for Inductive Link Prediction in Knowledge GraphsJiajun Chen, Huarui He, Feng Wu, Jie WangAAAI 2021 · 被引用 161 次
相关 Paper
- 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 次
- Relation-enhanced Negative Sampling for Multimodal Knowledge Graph CompletionDerong Xu, Tong Xu, Shiwei Wu, Jingbo Zhou 等ACM MM 2022 · 被引用 89 次
- Multimodal Knowledge Graph Completion via Relation-Aware Negative Sampling with Diffusion-based InterpolationQian Ma, Linfei Dai, Zhongming Yao, Yu Gu 等VLDB 2026
- INDIGO: GNN-Based Inductive Knowledge Graph Completion Using Pair-Wise EncodingShuwen Liu, Bernardo Cuenca Grau, Ian Horrocks, Egor V. KostylevNeurIPS 2021 · 被引用 128 次
