Pith. sign in

REVIEW 1 cited by

Graph Attention with Hierarchies for Multi-hop 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

arxiv 2301.11792 v1 pith:C65FHTCU submitted 2023-01-27 cs.CL cs.AI

classification cs.CLcs.AI
keywords graphattentionhierarchicalhotpotqamulti-hopnetworkquestionanswer
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

Multi-hop QA (Question Answering) is the task of finding the answer to a question across multiple documents. In recent years, a number of Deep Learning-based approaches have been proposed to tackle this complex task, as well as a few standard benchmarks to assess models Multi-hop QA capabilities. In this paper, we focus on the well-established HotpotQA benchmark dataset, which requires models to perform answer span extraction as well as support sentence prediction. We present two extensions to the SOTA Graph Neural Network (GNN) based model for HotpotQA, Hierarchical Graph Network (HGN): (i) we complete the original hierarchical structure by introducing new edges between the query and context sentence nodes; (ii) in the graph propagation step, we propose a novel extension to Hierarchical Graph Attention Network GATH (Graph ATtention with Hierarchies) that makes use of the graph hierarchy to update the node representations in a sequential fashion. Experiments on HotpotQA demonstrate the efficiency of the proposed modifications and support our assumptions about the effects of model related variables.

Discussion (0). Sign in to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Hierarchical Lexical Graph for Enhanced Multi-Hop Retrieval

    cs.IR 2025-06 conditional novelty 6.0 of 10

    A three-tier lexical graph with statement- and topic-level retrievers improves multi-hop question answering over chunk-based RAG, though the headline 23.1% relative gain is ambiguous.

Pith tools