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.

Similar Papers

Following Occam’s Razor: Dynamic Combination of Structured Knowledge for Multi-Hop Question Answering using LLMs (2025.findings-emnlp)

Copied to clipboard

Challenge: Multi-hop question answering is a challenging task that requires capturing information from multiple positions in multiple documents.
Approach: They propose a framework for integrating text-based and triple-based paradigms that incorporates structured knowledge into large-scale question answering.
Outcome: The proposed framework improves multi-hop question answering by incorporating structured knowledge into the models.
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.
Robust Knowledge Editing via Explicit Reasoning Chains for Distractor-Resilient Multi-Hop QA (2025.findings-emnlp)

Copied to clipboard

Challenge: Large language models encode vast amounts of knowledge but remain static once trained, making timely integration of emerging facts prohibitively expensive via full retraining.
Approach: They introduce a reasoning-chain-based editing framework that steers a pretrained LLM through four structured stages to filter distractors in a single pass.
Outcome: The proposed framework steers a pretrained LLM through four structured stages to filter distractors in a single pass.
Refiner: Restructure Retrieved Content Efficiently to Advance Question-Answering Capabilities (2024.findings-emnlp)

Copied to clipboard

Challenge: Large Language Models (LLMs) are limited by their parametric knowledge, leading to hallucinations in knowledge-extensive tasks.
Approach: They propose an end-to-end extract-and-restructure paradigm that leverages a single decoder-only LLM to adaptively extract query-relevant contents verbatim along with the necessary context.
Outcome: Experiments show that a trained Refiner outperforms state-of-the-art RAG and compressing approaches in multiple tasks.
LOG: A Local-to-Global Optimization Approach for Retrieval-based Explainable Multi-Hop Question Answering (2025.coling-main)

Copied to clipboard

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.
From Query to Logic: Ontology-Driven Multi-Hop Reasoning in LLMs (2026.findings-acl)

Copied to clipboard

Challenge: Large Language Models (LLMs) exhibit limitations in complex multi-hop question answering tasks that necessitate non-linear, structured reasoning.
Approach: They propose an ontology-driven reasoning and chain framework that combines LLMs’ generative capabilities with the structural benefits of knowledge graphs.
Outcome: Extensive experiments across a diverse set of models and standard MQA benchmarks demonstrate that the proposed framework achieves competitive performance while producing more interpretable reasoning chains.
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.
Mitigating Lost-in-Retrieval Problems in Retrieval Augmented Multi-Hop Question Answering (2025.acl-long)

Copied to clipboard

Challenge: Empirical results show that ChainRAG consistently outperforms baselines in both effectiveness and efficiency.
Approach: They propose a method which sequentially handles each sub-question by completing missing key entities and retrieving relevant sentences from a sentence graph for answer generation.
Outcome: The proposed method outperforms baselines on three multi-hop QA 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 .
Commonsense for Generative Multi-Hop Question Answering Tasks (D18-1)

Copied to clipboard

Challenge: Reading comprehension QA tasks have seen a recent surge in popularity, yet most work has focused on fact-finding extractive QA.
Approach: They propose a multi-hop generative task that uses a pointer-generator decoder to synthesize disjoint pieces of information within the context to generate an answer.
Outcome: The proposed model performs better than previous generative models and is competitive with current state-of-the-art span prediction models.

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