TasksSotADatasetsPapersMethodsSubmitAbout
Papers With Code 2

A community resource for machine learning research: papers, code, benchmarks, and state-of-the-art results.

Explore

Notable BenchmarksAll SotADatasetsPapersMethods

Community

Submit ResultsAbout

Data sourced from the PWC Archive (CC-BY-SA 4.0). Built by the community, for the community.

Papers/KBGAN: Adversarial Learning for Knowledge Graph Embeddings

KBGAN: Adversarial Learning for Knowledge Graph Embeddings

Liwei Cai, William Yang Wang

2017-11-11NAACL 2018 6Knowledge GraphsKnowledge Graph EmbeddingKnowledge Graph EmbeddingsKnowledge Base CompletionGraph EmbeddingLink Prediction
PaperPDFCodeCode(official)Code

Abstract

We introduce KBGAN, an adversarial learning framework to improve the performances of a wide range of existing knowledge graph embedding models. Because knowledge graphs typically only contain positive facts, sampling useful negative training examples is a non-trivial task. Replacing the head or tail entity of a fact with a uniformly randomly selected entity is a conventional method for generating negative facts, but the majority of the generated negative facts can be easily discriminated from positive facts, and will contribute little towards the training. Inspired by generative adversarial networks (GANs), we use one knowledge graph embedding model as a negative sample generator to assist the training of our desired model, which acts as the discriminator in GANs. This framework is independent of the concrete form of generator and discriminator, and therefore can utilize a wide variety of knowledge graph embedding models as its building blocks. In experiments, we adversarially train two translation-based models, TransE and TransD, each with assistance from one of the two probability-based models, DistMult and ComplEx. We evaluate the performances of KBGAN on the link prediction task, using three knowledge base completion datasets: FB15k-237, WN18 and WN18RR. Experimental results show that adversarial training substantially improves the performances of target embedding models under various settings.

Results

TaskDatasetMetricValueModel
Link PredictionWN18RRHits@100.469KBGAN (TransD + ComplEx)
Link PredictionWN18RRMRR0.215KBGAN (TransD + ComplEx)
Link PredictionWN18Hits@100.948KBGAN (TransD + ComplEx)
Link PredictionWN18MRR0.779KBGAN (TransD + ComplEx)
Link PredictionFB15k-237Hits@100.458KBGAN (TransD + ComplEx)
Link PredictionFB15k-237MRR0.277KBGAN (TransD + ComplEx)

Related Papers

SMART: Relation-Aware Learning of Geometric Representations for Knowledge Graphs2025-07-17Topic Modeling and Link-Prediction for Material Property Discovery2025-07-08Graph Collaborative Attention Network for Link Prediction in Knowledge Graphs2025-07-05Understanding Generalization in Node and Link Prediction2025-07-01Context-Driven Knowledge Graph Completion with Semantic-Aware Relational Message Passing2025-06-29Active Inference AI Systems for Scientific Discovery2025-06-26Enhancing LLM Tool Use with High-quality Instruction Data from Knowledge Graph2025-06-26Generating Reliable Adverse event Profiles for Health through Automated Integrated Data (GRAPH-AID): A Semi-Automated Ontology Building Approach2025-06-25