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. |
Similar Papers
Constraint-based Multi-hop Question Answering with Knowledge Graph (2022.naacl-industry)
Copied to clipboard
| Challenge: | Recent work addresses multi-hop KGQA, which requires reasoning across numerous edges of the KG. |
| Approach: | They propose to use KG embeddings to reduce KG sparsity by performing missing link prediction. |
| Outcome: | Empirical results show that the proposed method produces state-of-the-art results on three KGQA datasets. |
Do Multi-hop Readers Dream of Reasoning Chains? (D19-58)
Copied to clipboard
| Challenge: | Existing models for multihop reasoning are limited in their performance . multi-hop reasoning requires the ability to gather information from multiple passages . |
| Approach: | They propose a method that provides the full reasoning chain of multiple passages instead of just one final passage where the answer appears. |
| Outcome: | The proposed model improves on existing models by providing the full reasoning chain of multiple passages instead of just one final passage where the answer appears. |
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. |
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. |
Improving Query Graph Generation for Complex Question Answering over Knowledge Base (2021.emnlp-main)
Copied to clipboard
| Challenge: | Existing Knowledge-based Question Answering methods use a query graph to find the answer to a question. |
| Approach: | They propose a method that starts with the entire knowledge base and gradually shrinks it to the desired query graph. |
| Outcome: | Experimental results show that the proposed method achieves state-of-the-art performance on ComplexWebQuestion dataset. |
HOLMES: Hyper-Relational Knowledge Graphs for Multi-hop Question Answering using LLMs (2024.acl-long)
Copied to clipboard
| Challenge: | Existing approaches to answer multi-hop questions are query-agnostic and the extracted facts are ambiguous as they lack context. |
| Approach: | They propose to use a knowledge graph to extract query-relevant information from unstructured text. |
| Outcome: | The proposed method achieves performance improvements on two popular datasets. |
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. |
Exploiting Hybrid Semantics of Relation Paths for Multi-hop Question Answering over Knowledge Graphs (2022.coling-1)
Copied to clipboard
| Challenge: | Existing approaches to answer natural language questions on knowledge graphs (KGQA) use large-scale entity-related text corpus or knowledge graph embeddings as auxiliary information to facilitate answer selection. |
| Approach: | They propose to integrate explicit textual information and implicit KG structural features of relation paths into a novel rotate-and-scale entity link prediction framework. |
| Outcome: | The proposed method is superior to existing methods on three KGQA datasets and shows that it can be used to identify answer entities. |
Enhancing Complex Reasoning in Knowledge Graph Question Answering through Query Graph Approximation (2025.findings-acl)
Copied to clipboard
| Challenge: | Existing knowledge-grounded question answering frameworks lack essential triplets related to the questions . Existing approaches to knowledge-based QA are incomplete in the context of KGs . |
| Approach: | They propose a framework to provide answers to structured queries by leveraging Knowledge Graphs. |
| Outcome: | The proposed framework outperforms existing methods on QA tasks where KGs are incomplete . the framework is based on a set of data from a dataset of QA questions . |
Query Graph Generation for Answering Multi-hop Complex Questions from Knowledge Bases (2020.acl-main)
Copied to clipboard
| Challenge: | Existing work on complex knowledge base question answering addresses two types of complexity at the same time. |
| Approach: | They propose a modified staged query graph generation method that handles both types of complexity at the same time. |
| Outcome: | The proposed method achieves state-of-the-art on three benchmark KBQA datasets. |