Diversified and Adaptive Negative Sampling on Knowledge Graphs
Ran Liu, Zhongzhou Liu, Xiaoli Li, Hao Wu, Yuan Fang

TL;DR
This paper introduces DANS, a novel generative adversarial approach for negative sampling in knowledge graph embedding, enhancing diversity and adaptiveness to improve model training.
Contribution
The paper proposes DANS, a two-way generator with adaptive mechanisms that produce more diverse and fine-grained negative triplets for knowledge graph embedding.
Findings
DANS outperforms existing sampling methods on benchmark datasets.
Enhanced diversity and adaptiveness lead to better embedding quality.
Quantitative and qualitative experiments validate effectiveness.
Abstract
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 graphs are sparse and incomplete, negative triplets often lack explicit labels, and thus they are often obtained from various sampling strategies (eg: randomly replacing an entity in a positive triplet). An ideal sampled negative triplet should be informative enough to help the model train better. However, existing methods often ignore diversity and adaptiveness in their sampling process, which harms the informativeness of negative triplets. As such, we propose a generative adversarial approach called Diversified and Adaptive Negative Sampling DANS on knowledge graphs. DANS is equipped with a two-way generator that generates more diverse negative triplets through two…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsDomain Adaptation and Few-Shot Learning · Machine Learning and ELM · Machine Learning and Algorithms
