SMORE: Knowledge Graph Completion and Multi-hop Reasoning in Massive Knowledge Graphs

10/28/2021
by   Hongyu Ren, et al.
6

Knowledge graphs (KGs) capture knowledge in the form of head–relation–tail triples and are a crucial component in many AI systems. There are two important reasoning tasks on KGs: (1) single-hop knowledge graph completion, which involves predicting individual links in the KG; and (2), multi-hop reasoning, where the goal is to predict which KG entities satisfy a given logical query. Embedding-based methods solve both tasks by first computing an embedding for each entity and relation, then using them to form predictions. However, existing scalable KG embedding frameworks only support single-hop knowledge graph completion and cannot be applied to the more challenging multi-hop reasoning task. Here we present Scalable Multi-hOp REasoning (SMORE), the first general framework for both single-hop and multi-hop reasoning in KGs. Using a single machine SMORE can perform multi-hop reasoning in Freebase KG (86M entities, 338M edges), which is 1,500x larger than previously considered KGs. The key to SMORE's runtime performance is a novel bidirectional rejection sampling that achieves a square root reduction of the complexity of online training data generation. Furthermore, SMORE exploits asynchronous scheduling, overlapping CPU-based data sampling, GPU-based embedding computation, and frequent CPU–GPU IO. SMORE increases throughput (i.e., training speed) over prior multi-hop KG frameworks by 2.2x with minimal GPU memory requirements (2GB for training 400-dim embeddings on 86M-node Freebase) and achieves near linear speed-up with the number of GPUs. Moreover, on the simpler single-hop knowledge graph completion task SMORE achieves comparable or even better runtime performance to state-of-the-art frameworks on both single GPU and multi-GPU settings.

READ FULL TEXT
research
06/12/2018

Recurrent One-Hop Predictions for Reasoning over Knowledge Graphs

Large scale knowledge graphs (KGs) such as Freebase are generally incomp...
research
05/28/2022

TFLEX: Temporal Feature-Logic Embedding Framework for Complex Reasoning over Temporal Knowledge Graph

Multi-hop logical reasoning over knowledge graph (KG) plays a fundamenta...
research
10/14/2022

Dense-ATOMIC: Construction of Densely-connected and Multi-hop Commonsense Knowledge Graph upon ATOMIC

ATOMIC is a large-scale commonsense knowledge graph (CSKG) containing ev...
research
10/05/2020

MCMH: Learning Multi-Chain Multi-Hop Rules for Knowledge Graph Reasoning

Multi-hop reasoning approaches over knowledge graphs infer a missing rel...
research
01/17/2022

SQUIRE: A Sequence-to-sequence Framework for Multi-hop Knowledge Graph Reasoning

Multi-hop knowledge graph (KG) reasoning has been widely studied in rece...
research
06/17/2023

Do as I can, not as I get: Topology-aware multi-hop reasoning on multi-modal knowledge graphs

Multi-modal knowledge graph (MKG) includes triplets that consist of enti...
research
12/19/2020

T-GAP: Learning to Walk across Time for Temporal Knowledge Graph Completion

Temporal knowledge graphs (TKGs) inherently reflect the transient nature...

Please sign up or login with your details

Forgot password? Click here to reset