mlsanityData to 14 Oct 2026

Enhancing PyKEEN with Multiple Negative Sampling Solutions for Knowledge Graph Embedding Models

arXiv 2508.05587 ↗First posted 7 Aug 2025cs.LGcited by 1

Not on the map. Why?

Abstract (arXiv)

Embedding methods have become popular due to their scalability on link prediction and/or triple classification tasks on Knowledge Graphs. Embedding models are trained relying on both positive and negative samples of triples. However, in the absence of negative assertions, these must be usually artificially generated using various negative sampling strategies, ranging from random corruption to more sophisticated techniques which have an impact on the overall performance. Most of the popular libraries for knowledge graph embedding, support only basic such strategies and lack advanced solutions. To address this gap, we deliver an extension for the popular KGE framework PyKEEN that integrates a suite of several advanced negative samplers (including both static and dynamic corruption strategies), within a consistent modular architecture, to generate meaningful negative samples, while remaining compatible with existing PyKEEN -based workflows and pipelines. The developed extension not only enhancesPyKEEN itself but also allows for easier and comprehensive development of embedding methods and/or for their customization. As a proof of concept, we present a comprehensive empirical study of the developed extensions and their impact on the performance (link prediction tasks) of different embedding methods, which also provides useful insights for the design of more effective strategies

Key facts. Cited by 1 paper in the map (data through 14 Oct 2026). Builds on 22 of its 40 references that are in the map. First posted on arXiv 7 Aug 2025.

Builds on

22 of 40 references.

References · 22

  1. 2013Distributed Representations of Words and Phrases and their Compositionalitycited by 3,474
  2. 2014Embedding Entities and Relations for Learning and Inference in Knowledge Basescited by 932
  3. 2016Complex Embeddings for Simple Link Predictioncited by 902
  4. 2019RotatE: Knowledge Graph Embedding by Relational Rotation in Complex Spacecited by 898
  5. 2015A Review of Relational Machine Learning for Knowledge Graphscited by 265
  6. 2018SimplE Embedding for Link Prediction in Knowledge Graphscited by 195
  7. 2015Holographic Embeddings of Knowledge Graphscited by 181
  8. 2019Quaternion Knowledge Graph Embeddingscited by 175
  9. 2020A Survey on Knowledge Graph-Based Recommender Systemscited by 170
  10. 2020BoxE: A Box Embedding Model for Knowledge Base Completioncited by 105
  11. 2020PyKEEN 1.0: A Python Library for Training and Evaluating Knowledge Graph Embeddingscited by 77
  12. 2020DGL-KE: Training Knowledge Graph Embeddings at Scalecited by 67
10 more
  1. 2017KBGAN: Adversarial Learning for Knowledge Graph Embeddingscited by 62
  2. 2018NSCaching: Simple and Efficient Negative Sampling for Knowledge Graph Embeddingcited by 42
  3. 2019GraphVite: A High-Performance CPU-GPU Hybrid System for Node Embeddingcited by 40
  4. 2015Type-Constrained Representation Learning in Knowledge Graphscited by 34
  5. 2017Analysis of the Impact of Negative Sampling on Link Prediction in Knowledge Graphscited by 23
  6. 2020TorchKGE: Knowledge Graph Embedding in Python and PyTorchcited by 9
  7. 2024Negative Sampling in Knowledge Graph Representation Learning: A Reviewcited by 9
  8. 2023Negative Sampling with Adaptive Denoising Mixup for Knowledge Graph Embeddingcited by 7
  9. 2019Distributional Negative Sampling for Knowledge Base Completioncited by 5
  10. 2022Entity Aware Negative Sampling with Auxiliary Loss of False Negative Prediction for Knowledge Graph Embeddingcited by 4

Built on by

Cited by year (2026 to 14 Oct)

Citing papers per year: 2026: 1.

1 paper.