REVIEW 2 cited by
Scalable Multi-Hop Relational Reasoning for Knowledge-Aware Question Answering
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
Signed reviews
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.
Forward citations
Cited by 2 Pith papers
-
Matching Tasks with Industry Groups for Augmenting Commonsense Knowledge
A weakly supervised pipeline extracts and matches company tasks from news to 24 industry groups, producing 2,339 task-industry triples at 0.86 precision.
-
A Survey on Retrieval And Structuring Augmented Generation with Large Language Models
The paper presents a comprehensive survey and taxonomy of RAS methods, covering retrieval, text structuring, and LLM integration.
Discussion (0). Continue with ORCID to comment.