Optimizing Question Semantic Space for Dynamic Retrieval-Augmented Multi-hop Question Answering (2025.acl-long)
Copied to clipboard
| Challenge: | Existing retrieval-augmented generation methods are insufficient for multi-hop question answering . however, they tend to generate hallucinations due to semantic mismatching . |
| Approach: | They propose to optimize question semantic space for dynamic retrieval-augmented multi-hop question answering by optimizing the semantic embeddings. |
| Outcome: | The proposed method outperforms existing RAG methods in both in- and out-of-domain settings. |
Similar Papers
Question Decomposition for Retrieval-Augmented Generation (2025.acl-srw)
Copied to clipboard
| Challenge: | Retrieval-augmented generation (RAG) is effective for question answering tasks . multi-hop questions, such as "Which company among NVIDIA, Apple, and Google made the biggest profit in 2023?" challenge RAG because relevant facts are often distributed across multiple documents . |
| Approach: | They propose a pipeline that incorporates question decomposition to ground large language models in verifiable external sources. |
| Outcome: | The proposed approach improves retrieval and answer accuracy over standard RAG . multi-hop questions often require multiple documents to support the model . |
EfficientRAG: Efficient Retriever for Multi-Hop Question Answering (2024.emnlp-main)
Copied to clipboard
Ziyuan Zhuang, Zhiyang Zhang, Sitao Cheng, Fangkai Yang, Jia Liu, Shujian Huang, Qingwei Lin, Saravan Rajmohan, Dongmei Zhang, Qi Zhang
| Challenge: | Existing retrieval-augmented generation methods rely on multiple calls of large language models (LLMs) Large-language models lack knowledge underrepresented in training data and still face hallucinations. |
| Approach: | They propose an efficient retriever for multi-hop question answering that generates new queries iteratively without the need for LLM calls. |
| Outcome: | The proposed method surpasses existing methods on three open-domain multi-hop question-answering datasets. |
QPaug: Question and Passage Augmentation for Open-Domain Question Answering of LLMs (2024.findings-emnlp)
Copied to clipboard
| Challenge: | Existing approaches to augmented generation of retrieved passages rely on the quality of a question's retrieved information. |
| Approach: | They propose a simple yet efficient method called question and passage augmentation via LLMs for open-domain QA. |
| Outcome: | The proposed method outperforms the state-of-the-art and achieves significant performance gain over existing methods. |
MINTQA: A Multi-Hop Question Answering Benchmark for Evaluating LLMs on New and Long-tail Knowledge (2026.acl-long)
Copied to clipboard
| Challenge: | Existing studies have shown that large language models can handle knowledge with varying familiarity. |
| Approach: | They propose a benchmark to evaluate multi-hop question answering on new and tail knowledge . they use RAG to integrate external knowledge into large language models . |
| Outcome: | The proposed benchmark evaluates the multi-hop reasoning ability of large language models . it primarily evaluates their ability to handle knowledge with different levels of familiarity . |
Resource-Friendly Dynamic Enhancement Chain for Multi-Hop Question Answering (2025.findings-acl)
Copied to clipboard
Binquan Ji, Haibo Luo, YifeiLu YifeiLu, Lei Hei, Jiaqi Wang, Tingjing Liao, Wang Lingyu, Shichao Wang, Feiliang Ren
| 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. |
PAR2-RAG: Planned Active Retrieval and Reasoning for Multi-Hop Question Answering (2026.acl-industry)
Copied to clipboard
| Challenge: | Multi-hop question answering is a practical bottleneck in industry applications . large language models (LLMs) fail frequently when evidence coverage is incomplete or reasoning trajectories drift . |
| Approach: | They propose a training-free two-stage framework that separates coverage from commitment . it performs breadth-first anchoring to build a high-recall evidence frontier . compared with IRCoT, it achieves 23.5% higher answer accuracy . |
| Outcome: | The proposed framework outperforms strong baselines in MHQA benchmarks and achieves 23.5% higher answer accuracy and 10.5% NDCG gains in retrieval quality. |
PROGRAM: Programmatic Retrieval Optimization with Generative Reasoning and Augmented Multi-queries (2026.findings-acl)
Copied to clipboard
| Challenge: | Current retrieval-augmented generation methods struggle with complex multi-hop reasoning, relying on unstructured semantic matching that lacks the logical structure needed to systematically guide retrieval. |
| Approach: | They propose a framework that elevates retrieval to structured, program-guided reasoning by combining three stages of program-type selection and evidence accumulation. |
| Outcome: | Evaluated on five benchmarks including HotPotQA, 2WikiMultihopQA, ARC-Challenge, MMLU-Pro, and MedQA with various LLMs, PROGRAM achieves state-of-the-art performance with up to 24% relative improvement on HotPtQA and 13.2% on MedQA over strong baselines including FLARE, ProbTree and Self-RAG. |
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. |
RAG-on-a-Diet: A Reinforcement Learning-Based Dynamic Resource Optimization Framework for RAG (2026.acl-long)
Copied to clipboard
| Challenge: | Existing frameworks for knowledge-intensive multi-hop question answering do not adapt to how a trajectory unfolds. |
| Approach: | They propose a lightweight reinforcement-learning agent that treats each reasoning hop as an independent decision and selects the smallest model sufficient for it. |
| Outcome: | The proposed agent cuts Monetary Inference Cost by 60.07% against IRCoT with only a 3.7% F1 drop and matches Adaptive-RAG’s F1 at 37.30% lower cost. |
Optimizing Multi-Hop Document Retrieval Through Intermediate Representations (2025.findings-acl)
Copied to clipboard
| Challenge: | Existing approaches to addressing multi-hop queries are computationally expensive . despite their success, large language models often generate factually incorrect answers . |
| Approach: | They propose a layer-by-layer reasoning approach that leverages intermediate representations from the middle layers to retrieve external knowledge. |
| Outcome: | The proposed method outperforms existing RAG methods on open-domain multi-hop question-answering datasets while maintaining inference overhead similar to that of standard RAG. |