| Challenge: | Text-based question answering (TBQA) has been studied extensively in recent years. |
| Approach: | They propose a Dynamically Fused Graph Network to answer questions requiring multiple scattered evidence and reasoning over them. |
| Outcome: | The proposed method achieves competitive results on a public TBQA dataset and produces interpretable reasoning chains. |
Similar Papers
Identifying Supporting Facts for Multi-hop Question Answering with Document Graph Networks (D19-53)
Copied to clipboard
| Challenge: | Recent advances in reading comprehension have resulted in models that surpass human performance when the answer is contained in a single, continuous passage of text. |
| Approach: | They propose a document-structured message passing architecture for the identification of supporting facts over a graph-structure based representation of text. |
| Outcome: | The proposed model outperforms a baseline reading comprehension test on raw text and shows that it is relevant for multi-hop reasoning. |
Multi-hop Graph Convolutional Network with High-order Chebyshev Approximation for Text Reasoning (2021.acl-long)
Copied to clipboard
| Challenge: | Existing single-hop graph reasoning in Graph convolutional networks may miss some important non-consecutive dependencies. |
| Approach: | They propose a graph convolutional network with the high-order dynamic Chebyshev approximation which augments multi-hop graph reasoning by fusing messages aggregated from direct and long-term dependencies into one convolutionalist layer. |
| Outcome: | The proposed model improves on four transductive and inductive NLP tasks and the ablation of the existing model. |
Dynamic Semantic Graph Construction and Reasoning for Explainable Multi-hop Science Question Answering (2021.findings-acl)
Copied to clipboard
| Challenge: | Existing approaches suffer from low confidence when retrieving evidence facts to fill the knowledge gap and lack transparent reasoning process. |
| Approach: | They propose a framework to exploit more valid facts while obtaining explainability for multi-hop question answering at web scale by dynamically constructing a semantic graph and reasoning over it. |
| Outcome: | The proposed framework surpasses existing approaches while maintaining high explainability on OpenBookQA and ARC-Challenge. |
Multi-hop Question Generation with Graph Convolutional Network (2020.findings-emnlp)
Copied to clipboard
| Challenge: | Existing studies on text-based QG focus on generating SQuAD-style questions. |
| Approach: | They propose a multi-hop question generation model that does context encoding in multiple hops with Graph Convolutional Network and encoder fusion via an Encoder Reasoning Gate. |
| Outcome: | Empirical results show that the proposed model generates fluent questions with high completeness and outperforms baselines on automatic evaluation metrics. |
Multi-hop Reading Comprehension across Multiple Documents by Reasoning over Heterogeneous Graphs (P19-1)
Copied to clipboard
| Challenge: | Existing models to tackle multi-hop reading comprehension (RC) are focusing on a single document or paragraph, but they lack the ability to do reasoning across multiple documents. |
| Approach: | They propose a heterogeneous document-entity graph with different types of nodes and edges to solve multi-hop RC problem. |
| Outcome: | The proposed model can do reasoning over the proposed graph with nodes representation initialized with co-attention and self-attention based context encoders. |
Cognitive Graph for Multi-Hop Reading Comprehension at Scale (P19-1)
Copied to clipboard
| Challenge: | a new framework for multi-hop reading comprehension question answering is needed to cross the chasm of reading comprehension between machine and human. |
| Approach: | They propose a CogQA framework for multi-hop reading comprehension question answering in web-scale documents that builds a cognitive graph in an iterative process by coordinating an implicit extraction module and an explicit reasoning module. |
| Outcome: | The proposed framework outperforms the best competitor in the hotpotQA dataset in F1 . it provides explainable reasoning paths and accurate answers, while giving accurate answers . |
Compositional Questions Do Not Necessitate Multi-hop Reasoning (P19-1)
Copied to clipboard
| Challenge: | a single-hop reasoning model can solve much more of the dataset than previously thought. |
| Approach: | They propose a single-hop BERT-based RC model that achieves 67 F1 . they propose an evaluation setting where humans are not shown all paragraphs . |
| Outcome: | The proposed model achieves 67 F1—comparable to state-of-the-art multi-hop models. |
Towards Graph-hop Retrieval and Reasoning in Complex Question Answering over Textual Database (2024.lrec-main)
Copied to clipboard
| Challenge: | Existing benchmarks for textual question answering only focus on single-chain or single-hop retrieval . Existing approaches to answer complex questions have limitations . |
| Approach: | They propose to conduct Graph-Hop, a novel multi-chains and multi-hops retrieval paradigm in complex question answering. |
| Outcome: | The proposed model provides explicit and fine-grained evidence graphs for complex question to support comprehensive and detailed reasoning. |
Hierarchical Graph Network for Multi-hop Question Answering (2020.emnlp-main)
Copied to clipboard
| Challenge: | Existing multi-hop question answering models focus on multi-level reasoning across multiple documents or paragraphs. |
| Approach: | They propose a hierarchical graph network that aggregates clues from scattered texts . they use a set of contextual encoders to initialize nodes on different levels of granularity . |
| Outcome: | The proposed model outperforms existing multi-hop QA approaches on the HotpotQA benchmark. |
An Interpretable Reasoning Network for Multi-Relation Question Answering (C18-1)
Copied to clipboard
| Challenge: | Existing models for multi-relation question answering require elaborated analysis and reasoning over multiple fact triples in knowledge base. |
| Approach: | They propose a model that employs an interpretable hop-by-hop reasoning process for question answering . it decides which part of an input question should be analyzed at each hop and then drives next-hop thinking . |
| Outcome: | The proposed model yields state-of-the-art results on two datasets. |