REVIEW 1 cited by
Is Graph Structure Necessary 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
read the original abstract
Recently, attempting to model texts as graph structure and introducing graph neural networks to deal with it has become a trend in many NLP research areas. In this paper, we investigate whether the graph structure is necessary for multi-hop question answering. Our analysis is centered on HotpotQA. We construct a strong baseline model to establish that, with the proper use of pre-trained models, graph structure may not be necessary for multi-hop question answering. We point out that both graph structure and adjacency matrix are task-related prior knowledge, and graph-attention can be considered as a special case of self-attention. Experiments and visualized analysis demonstrate that graph-attention or the entire graph structure can be replaced by self-attention or Transformers.
Forward citations
Cited by 1 Pith paper
-
Multimodal Multihop Source Retrieval for Web Question Answering
A lightweight GraphSAGE model with star-graph connections outperforms a pairwise VLP transformer on image query source retrieval in WebQA, but underperforms it overall.
Discussion (0). Continue with ORCID to comment.