mlsanityData to 14 Oct 2026

DANS-KGC: Diffusion Based Adaptive Negative Sampling for Knowledge Graph Completion

arXiv 2511.07901 ↗First posted 11 Nov 2025cs.AIcited by 1

Not on the map. Why?

Abstract (arXiv)

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.

Key facts. Cited by 1 paper in the map (data through 14 Oct 2026). First posted on arXiv 11 Nov 2025.

Builds on

0 of 0 references.

No references here yet.

Built on by

Cited by year (2026 to 14 Oct)

Citing papers per year: 2026: 1.

1 paper.

Similar, not cited

Close in wording, no citation either way

  1. 2026Negative-Aware Diffusion Process for Temporal Knowledge Graph Extrapolation
  2. 2026RADD: Retrieval-Augmented Discrete Diffusion for Multi-Modal Knowledge Graph Completion
  3. 2026One Pass for All: A Discrete Diffusion Model for Knowledge Graph Triple Set Prediction
  4. 2025DiffusionCom: Structure-Aware Multimodal Diffusion Model for Multimodal Knowledge Graph Completion
  5. 2026BLADE: Distilled LLM Regularization for Calibrated Knowledge Graph Completion
  6. 2025TA-KAND: Two-stage Attention Triple Enhancement and U-KAN based Diffusion For Few-shot Knowledge Graph Completion
  7. 2025Enhancing Knowledge Graph Completion with Entity Neighborhood and Relation Context
  8. 2025Unlearning of Knowledge Graph Embedding via Preference Optimization