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.

Similar Papers

Simple yet Effective Bridge Reasoning for Open-Domain Multi-Hop Question Answering (D19-58)

Copied to clipboard

Challenge: Existing work on open-domain multi-hop question answering relies on off-the-shelf information retrieval techniques to retrieve answer passages.
Approach: They propose a new subproblem for open-domain multi-hop question answering . they aim to recognize the anchor from a set of start passages with a reading comprehension model .
Outcome: The proposed method significantly improves the baseline method on the open-domain hotpotQA benchmark.
Understanding and Improving Zero-shot Multi-hop Reasoning in Generative Question Answering (2022.coling-1)

Copied to clipboard

Challenge: Generative question answering (QA) models generate answers to complex questions, but their mechanism for doing so is still poorly understood.
Approach: They decompose multi-hop questions into multiple corresponding single-hop question chains and find marked inconsistency in QA models’ answers on these pairs of ostensibly identical question chains.
Outcome: The proposed models lack zero-shot multi-hop reasoning ability when trained on single-hop questions and on logical forms.
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.
Answering Questions by Meta-Reasoning over Multiple Chains of Thought (2023.emnlp-main)

Copied to clipboard

Challenge: Modern systems for multi-hop question answering (QA) break questions into a sequence of reasoning steps, termed chain-of-thought (CoT) Often, multiple chains are sampled and aggregated, but the intermediate steps themselves are discarded.
Approach: They propose a method which prompts large language models to meta-reason over multiple chains of thought rather than aggregate their answers.
Outcome: The proposed approach outperforms baselines on 7 multi-hop QA datasets.
Do Multi-Hop Question Answering Systems Know How to Answer the Single-Hop Sub-Questions? (2021.eacl-main)

Copied to clipboard

Challenge: Existing models fail to answer a large portion of sub-questions . Existing systems have achieved super-human performance .
Approach: They propose to use a neural decomposition model to generate sub-questions for a multi-hop question and extract the corresponding sub-answers.
Outcome: The proposed model is based on a hotpotQA dataset with a multi-hop question and sub-answers.
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 .
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.
Seemingly Plausible Distractors in Multi-Hop Reasoning: Are Large Language Models Attentive Readers? (2024.emnlp-main)

Copied to clipboard

Challenge: State-of-the-art Large Language Models (LLMs) are accredited with a number of different capabilities, including reading comprehension, mathematical and reasoning skills, and possessing scientific knowledge.
Approach: They propose a benchmark to generate seemingly plausible multi-hop reasoning chains that ultimately lead to incorrect answers.
Outcome: The proposed model circumvents the reasoning requirement but in subtle ways . it shows that it is more difficult to generate plausible alternatives .
BELLE: A Bi-Level Multi-Agent Reasoning Framework for Multi-Hop Question Answering (2025.acl-long)

Copied to clipboard

Challenge: Existing studies on multi-hop question answering employ specific methods regardless of question types . complexity of multihop question answerrs often exceeds knowledge boundaries of LLMs .
Approach: They propose a framework that uses chain-of-thought prompting to prompt LLMs to answer multi-hop questions.
Outcome: The proposed framework outperforms baseline models in multi-hop QA scenarios.

What is GenGO?

GenGO is an NLP powered publication search system. It currenctly indexes 30k+ papers from ACL Anthology, and implements multi-aspect summarization, semantic search, and more!

Information

About
Limitations