Graph Attention with Hierarchies for Multi-hop Question Answering

Yunjie He, Philip John Gorinski, Ieva Staliunaite, Pontus Stenetorp
1/27/2023
cs.CLcs.AI

No confident code implementation found for this paper. 10 possible matches can be shown below.

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.

View on arXivView PDF

Code Implementations

No confident code match yet

We couldn't find an author-owned or strongly-evidenced community implementation for this paper. 10 weaker matches are hidden by default — verify before relying on them.

No code implementations found yet.

Know of an implementation? Let us know in the comments below!

Similar Papers

Cite this paper

@article{he2023graph,
  title  = {Graph Attention with Hierarchies for Multi-hop Question Answering},
  author = {Yunjie He and Philip John Gorinski and Ieva Staliunaite and Pontus Stenetorp},
  year   = {2023},
  eprint = {2301.11792},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2301.11792v1}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2301.11792.svg)](https://codeofpaper.com/paper/2301.11792)

Discussion