pith. sign in

arxiv: 2005.00646 · v2 · pith:P3RPETOOnew · submitted 2020-05-01 · 💻 cs.CL · cs.LG

Scalable Multi-Hop Relational Reasoning for Knowledge-Aware Question Answering

classification 💻 cs.CL cs.LG
keywords multi-hopreasoningknowledgeansweringexternalgraphgraphsknowledge-aware
0
0 comments X
read the original abstract

Existing work on augmenting question answering (QA) models with external knowledge (e.g., knowledge graphs) either struggle to model multi-hop relations efficiently, or lack transparency into the model's prediction rationale. In this paper, we propose a novel knowledge-aware approach that equips pre-trained language models (PTLMs) with a multi-hop relational reasoning module, named multi-hop graph relation network (MHGRN). It performs multi-hop, multi-relational reasoning over subgraphs extracted from external knowledge graphs. The proposed reasoning module unifies path-based reasoning methods and graph neural networks to achieve better interpretability and scalability. We also empirically show its effectiveness and scalability on CommonsenseQA and OpenbookQA datasets, and interpret its behaviors with case studies.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.