DANS-KGC: Diffusion Based Adaptive Negative Sampling for Knowledge Graph Completion
Negative sampling (NS) strategies play a crucial role in knowledge graph representation. In order to overcome the limitations of existing negative sampling strategies, such as vulnerability to false negatives, limited generalization, and lack of control over sample hardness, we propose DANS-KGC (Diffusion-based Adaptive Negative Sampling for Knowledge Graph Completion). DANS-KGC comprises three key components: the Difficulty Assessment Module (DAM), the Adaptive Negative Sampling Module (ANS), and the Dynamic Training Mechanism (DTM). DAM evaluates the learning difficulty of entities by integrating semantic and structural features. Based on this assessment, ANS employs a conditional diffusion model with difficulty-aware noise scheduling, leveraging semantic and neighborhood information during the denoising phase to generate negative samples of diverse hardness. DTM further enhances learning by dynamically adjusting the hardness distribution of negative samples throughout training, enabling a curriculum-style progression from easy to hard examples. Extensive experiments on six benchmark datasets demonstrate the effectiveness and generalization ability of DANS-KGC, with the method achieving state-of-the-art results on all three evaluation metrics for the UMLS and YAGO3-10 datasets.
Code (0)
등록된 구현이 없습니다.
Tasks
Knowledge Graph CompletionSimilar Papers 제목 키워드 기반
Diversified and Adaptive Negative Sampling on Knowledge Graphs
In knowledge graph embedding, aside from positive triplets (ie: facts in the knowledge graph), the negative triplets used for training also have a direct influence on the model performance. In reality, since knowledge gr…
Graph EmbeddingInformativenessKnowledge Graph EmbeddingKnowledge Graphs+1Point Cloud Upsampling Using Conditional Diffusion Module with Adaptive Noise Suppression
Point cloud upsampling can improve the quality of the initial point cloud, significantly enhancing the performance of downstream tasks such as classification and segmentation. Existing methods mostly focus on generat…
point cloud upsamplingDiffusion-based Hierarchical Negative Sampling for Multimodal Knowledge Graph Completion
Multimodal Knowledge Graph Completion (MMKGC) aims to address the critical issue of missing knowledge in multimodal knowledge graphs (MMKGs) for their better applications. However, both the previous MMGKC and negative sa…
Knowledge Graph CompletionKnowledge GraphsDiffusion Models with Adaptive Negative Sampling Without External Resources
Diffusion models (DMs) have demonstrated an unparalleled ability to create diverse and high-fidelity images from text prompts. However, they are also well-known to vary substantially regarding both prompt adherence and q…
Reinforced Negative Sampling over Knowledge Graph for Recommendation
Properly handling missing data is a fundamental challenge in recommendation. Most present works perform negative sampling from unobserved data to supply the training of recommender models with negative signals. Neverthel…
Reinforcement Learning