Differentiable Representations For Multihop Inference Rules

05/24/2019
by   William W. Cohen, et al.
0

We present efficient differentiable implementations of second-order multi-hop reasoning using a large symbolic knowledge base (KB). We introduce a new operation which can be used to compositionally construct second-order multi-hop templates in a neural model, and evaluate a number of alternative implementations, with different time and memory trade offs. These techniques scale to KBs with millions of entities and tens of millions of triples, and lead to simple models with competitive performance on several learning tasks requiring multi-hop reasoning.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
02/14/2020

Scalable Neural Methods for Reasoning With a Symbolic Knowledge Base

We describe a novel way of representing a symbolic knowledge base (KB) c...
research
05/15/2019

Neural Query Language: A Knowledge Base Query Language for Tensorflow

Large knowledge bases (KBs) are useful for many AI tasks, but are diffic...
research
08/05/2022

Going Beyond Approximation: Encoding Constraints for Explainable Multi-hop Inference via Differentiable Combinatorial Solvers

Integer Linear Programming (ILP) provides a viable mechanism to encode e...
research
02/25/2020

Differentiable Reasoning over a Virtual Knowledge Base

We consider the task of answering complex multi-hop questions using a co...
research
01/02/2021

Baleen: Robust Multi-Hop Reasoning at Scale via Condensed Retrieval

Multi-hop reasoning (i.e., reasoning across two or more documents) at sc...
research
09/11/2023

Memory Injections: Correcting Multi-Hop Reasoning Failures during Inference in Transformer-Based Language Models

Answering multi-hop reasoning questions requires retrieving and synthesi...
research
06/06/2023

ChatDB: Augmenting LLMs with Databases as Their Symbolic Memory

Large language models (LLMs) with memory are computationally universal. ...

Please sign up or login with your details

Forgot password? Click here to reset