Challenge: Existing approaches to multi-hop question answering emphasize single-step and multi-step iterative decomposition or retrieval, which are susceptible to failure in long-chain reasoning due to the progressive accumulation of erroneous information.
Approach: They propose a Local-tO-Global optimized retrieval method to discover more beneficial information and improve tuplet objective loss.
Outcome: The proposed method outperforms state-of-the-art models and significantly improves multi-hop reasoning.

Similar Papers

Locate Then Ask: Interpretable Stepwise Reasoning for Multi-hop Question Answering (2022.coling-1)

Copied to clipboard

Challenge: Existing methods for multi-hop reasoning ignore grounding on supporting facts of each step, which tends to generate inaccurate decompositions.
Approach: They propose an interpretable stepwise reasoning framework that incorporates supporting sentences and questions at each intermediate step and utilizes the inference of the current hop for the next until reasoning out the final result.
Outcome: The proposed model can boost performance and yield a better interpretable reasoning process without decomposition supervision.
Uncertainty Guided Global Memory Improves Multi-Hop Question Answering (2023.emnlp-main)

Copied to clipboard

Challenge: Transformers are used to solve multi-hop question answering tasks that require reasoning over multiple parts of a long document.
Approach: They propose a method that collects relevant information over the entire document and then combines it with local context to solve a multi-hop question answering task.
Outcome: The proposed method improves on three MHQA datasets compared to the baseline model.
Resource-Friendly Dynamic Enhancement Chain for Multi-Hop Question Answering (2025.findings-acl)

Copied to clipboard

Challenge: Existing approaches to solve multi-hop question answering challenges require multiple rounds of retrieval and iterative generation.
Approach: They propose a framework that decomposes complex questions into coherent subquestions . it then iteratively refines these subquests through context-aware rewriting to generate effective query formulations.
Outcome: The proposed framework performs on par with or surpasses state-of-the-art benchmarks while significantly reducing token consumption.
SEARCH-R: Structured Entity-Aware Retrieval with Chain-of-Reasoning Navigator for Multi-hop Question Answering (2026.findings-acl)

Copied to clipboard

Challenge: Existing approaches to multi-hop question answering lack effective control over reasoning paths, leading to astray results.
Approach: They propose a framework for multi-hop question answering that trains an end-to-end reasoning path navigator to provide a powerful sub-question decomposer by fine-tuning the Llama3.1-8B model.
Outcome: The proposed framework trains an end-to-end reasoning path navigator . it is able to provide a powerful sub-question decomposer by fine-tuning the Llama3.1-8B model .
Multi-step Entity-centric Information Retrieval for Multi-Hop Question Answering (D19-58)

Copied to clipboard

Challenge: Multi-hop question answering (QA) requires an information retrieval system that can find multiple supporting evidence needed to answer the question.
Approach: They propose a technique that uses information of entities present in the initial retrieved evidence to learn to ‘hop’ onto other relevant evidence.
Outcome: The proposed method boosts retrieval performance on a multi-hop question answering dataset with 5 million Wikipedia paragraphs and a model without training increases its performance by 10.59 F1.
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.
DualRAG: A Dual-Process Approach to Integrate Reasoning and Retrieval for Multi-Hop Question Answering (2025.acl-long)

Copied to clipboard

Challenge: Existing approaches to multi-hop question answering struggle to identify and organize dynamic knowledge . et al., 2023; Liu e.t. al. 2023) suggest a dual-process framework for multi-step reasoning .
Approach: They propose a synergistic dual-process framework that integrates reasoning and retrieval.
Outcome: The proposed framework improves answer accuracy and coherence even in smaller-scale models.
Masking in Multi-hop QA: An Analysis of How Language Models Perform with Context Permutation (2025.acl-long)

Copied to clipboard

Challenge: Multi-hop Question Answering (MHQA) adds layers of complexity to question answering tasks.
Approach: They explore how LMs respond to multi-hop questions by permuting search results under various configurations.
Outcome: The proposed model outperforms decoder-only models in MHQA tasks despite being significantly smaller in size .
Search-in-Context: Efficient Multi-Hop QA over Long Contexts via Monte Carlo Tree Search with Dynamic KV Retrieval (2025.findings-acl)

Copied to clipboard

Challenge: Existing approaches to multihop question answering (MHQA) over long contexts are often neglecting explicit reasoning or incurring expensive computational costs due to full-attention mechanisms over long contextuals.
Approach: They propose a framework that integrates Monte Carlo Tree Search (MCTS) with dynamic key-value retrieval to enable iterative, context-aware reasoning.
Outcome: The proposed framework integrates Monte Carlo Tree Search (MCTS) with dynamic key-value (KV) retrieval to enable iterative, context-aware reasoning.
TRACE: Traversal Retrieval-Augmented Chain of Evidence for Document Understanding (2026.acl-long)

Copied to clipboard

Challenge: Long-context Document Visual Question Answering (DocVQA) methods struggle with visual semantics or handling finite context windows.
Approach: They propose a new approach to longcontext document visual question answering that transforms retrieval into adaptive evidence chain construction using a Bi-Layered Graph.
Outcome: The proposed approach achieves an average accuracy improvement of 14.07% on M5BookVQA and exhibits robust generalization with a 13.38% gain across four established benchmarks.

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