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. |
Similar Papers
WorldTree V2: A Corpus of Science-Domain Structured Explanations and Inference Patterns supporting Multi-Hop Inference (2020.lrec-1)
Copied to clipboard
Zhengnan Xie, Sebastian Thiem, Jaycie Martin, Elizabeth Wainwright, Steven Marmorstein, Peter Jansen
| Challenge: | Standardized science questions require combining an average of 6 facts and as many as 16 facts to answer and explain. |
| Approach: | They propose to combine an average of 6 facts and as many as 16 facts to produce an answer for complex questions. |
| Outcome: | The proposed model is based on a corpus of 5,114 standardized science exam questions . it uses multi-fact explanations that combine science knowledge and world knowledge . |
Scalable Multi-Hop Relational Reasoning for Knowledge-Aware Question Answering (2020.emnlp-main)
Copied to clipboard
| Challenge: | Existing work on augmenting question answering models with external knowledge (e.g., knowledge graphs) lacks transparency into the model’s prediction rationale. |
| Approach: | They propose a knowledge-aware approach that equips pre-trained language models with a multi-hop relational reasoning module that performs multi-relational reasoning over subgraphs extracted from external knowledge graphs. |
| Outcome: | The proposed model performs multi-hop, multi-relational reasoning over subgraphs extracted from external knowledge graphs. |
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. |
Improving Multi-hop Logical Reasoning in Knowledge Graphs with Context-Aware Query Representation Learning (2024.findings-acl)
Copied to clipboard
| Challenge: | Existing methods rely on linear sequential operations to solve First-Order Logic queries. |
| Approach: | They propose a model-agnostic approach that fully integrates the context of the query graph. |
| Outcome: | The proposed method improves performance on two datasets by 19.5%. |
Constructing A Multi-hop QA Dataset for Comprehensive Evaluation of Reasoning Steps (2020.coling-main)
Copied to clipboard
| Challenge: | Existing multi-hop question answering datasets do not provide a complete explanation for the reasoning process from the question to the answer. |
| Approach: | They propose a multi-hop question answering dataset that uses structured and unstructured data to test reasoning skills. |
| Outcome: | The proposed dataset ensures multi-hop reasoning while being challenging for multi-models. |
TransferNet: An Effective and Transparent Framework for Multi-hop Question Answering over Relation Graph (2021.emnlp-main)
Copied to clipboard
| Challenge: | Existing models infer the answer by predicting the sequential relation path or aggregating the hidden graph features. |
| Approach: | They propose a model which jumps between entities at multiple steps . they demonstrate that TransferNet surpasses state-of-the-art models by a large margin . |
| Outcome: | The proposed model surpasses state-of-the-art models on MetaQA and on other datasets. |
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. |
Leveraging Structured Information for Explainable Multi-hop Question Answering and Reasoning (2023.findings-emnlp)
Copied to clipboard
| Challenge: | Neural models, including large language models (LLMs), achieve superior performance on multi-hop question-answering tasks. |
| Approach: | They propose to use the chain-of-thought mechanism to generate both the reasoning chain and the answer. |
| Outcome: | Empirical results show that the proposed framework generates more faithful reasoning chains and significantly improves the QA performance on two benchmark datasets. |
Exploiting Reasoning Chains for Multi-hop Science Question Answering (2021.findings-emnlp)
Copied to clipboard
| Challenge: | Existing frameworks for multi-hop Science question answering do not require corpus-specific annotations. |
| Approach: | They propose a chain-guided retriever-reader framework that performs explainable reasoning without corpus annotations. |
| Outcome: | The proposed framework performs explainable reasoning without corpus-specific annotations . it is shown to be effective on OpenBookQA and ARC-Challenge . |
Dynamically Fused Graph Network for Multi-hop Reasoning (P19-1)
Copied to clipboard
| 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. |