HyperAIHyperAI

Command Palette

Search for a command to run...

3 months ago

Using Pairwise Occurrence Information to Improve Knowledge Graph Completion on Large-Scale Datasets

Esma Balkir Masha Naslidnyk Dave Palfrey Arpit Mittal

Using Pairwise Occurrence Information to Improve Knowledge Graph Completion on Large-Scale Datasets

Abstract

Bilinear models such as DistMult and ComplEx are effective methods for knowledge graph (KG) completion. However, they require large batch sizes, which becomes a performance bottleneck when training on large scale datasets due to memory constraints. In this paper we use occurrences of entity-relation pairs in the dataset to construct a joint learning model and to increase the quality of sampled negatives during training. We show on three standard datasets that when these two techniques are combined, they give a significant improvement in performance, especially when the batch size and the number of generated negative examples are low relative to the size of the dataset. We then apply our techniques to a dataset containing 2 million entities and demonstrate that our model outperforms the baseline by 2.8% absolute on hits@1.

Benchmarks

BenchmarkMethodologyMetrics
link-prediction-on-fb15kJoBi ComplEx
Hits@1: 0.681
Hits@10: 0.883
Hits@3: 0.824
MRR: 0.761
link-prediction-on-fb15k-237JoBi ComplEx
Hits@1: 0.199
Hits@10: 0.479
Hits@3: 0.319
MRR: 0.29

Build AI with AI

From idea to launch — accelerate your AI development with free AI co-coding, out-of-the-box environment and best price of GPUs.

AI Co-coding
Ready-to-use GPUs
Best Pricing
Get Started

Hyper Newsletters

Subscribe to our latest updates
We will deliver the latest updates of the week to your inbox at nine o'clock every Monday morning
Powered by MailChimp
Using Pairwise Occurrence Information to Improve Knowledge Graph Completion on Large-Scale Datasets | Papers | HyperAI