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.

Similar Papers

MBA-RAG: a Bandit Approach for Adaptive Retrieval-Augmented Generation through Question Complexity (2025.coling-main)

Copied to clipboard

Challenge: Existing RAG frameworks either indiscriminately perform retrieval or rely on rigid single-label classifiers to select retrieval methods.
Approach: They propose a framework that dynamically selects the most suitable retrieval strategy based on query complexity.
Outcome: The proposed framework achieves state-of-the-art results on multiple single-hop and multi-hop datasets while reducing retrieval costs.
S2G-RAG: Structured Sufficiency and Gap Judging for Iterative Retrieval-Augmented QA (2026.acl-long)

Copied to clipboard

Challenge: Retrieval-augmented generation grounds language models in external evidence, but multi-hop question answering remains difficult . iterative pipelines must control what to retrieve next and when evidence is adequate.
Approach: They propose an iterative framework with an explicit controller, S2G-Judge . they map structured gap items into the next retrieval query to produce stable retrieval trajectories .
Outcome: Experiments on TriviaQA, HotpotQA, and 2WikiMultiHopQA show that S2G-RAG improves multi-hop QA performance and robustness under multi-turn retrieval.
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.
Open-RAG: Enhanced Retrieval Augmented Reasoning with Open-Source Large Language Models (2024.findings-emnlp)

Copied to clipboard

Challenge: Existing methods to integrate Large Language Models with external knowledge suffer from limited reasoning capabilities, especially when using open-source LLMs.
Approach: They propose a framework that transforms an arbitrary dense LLM into a parameter-efficient sparse mixture of experts (MoE) model capable of handling complex reasoning tasks.
Outcome: The proposed framework transforms an arbitrary dense LLM into a parameter-efficient sparse mixture of experts (MoE) model capable of handling complex reasoning tasks, including both single- and multi-hop queries.
Reasoning with Memory: Adaptive Information Management for Retrieval-Augmented Generation (2026.findings-acl)

Copied to clipboard

Challenge: Multi-hop reasoning remains a fundamental challenge for Retrieval-Augmented Generation systems.
Approach: They propose a framework that provides a dynamic cognitive workspace for multi-hop reasoning . it uses an explicit working memory that persists across retrieval cycles and is continuously updated .
Outcome: The proposed framework achieves state-of-the-art performance over existing systems on eight QA benchmarks.
Reflective RAG: Self-Evaluation Driven Strategy Optimization in Agentic Retrieval-Augmented Generation (2026.findings-acl)

Copied to clipboard

Challenge: Recent agentic RAG systems lack the capacity to evaluate the utility of retrieved information, leading to brittle reasoning and suboptimal decision-making.
Approach: They propose a framework that integrates self-evaluation to dynamically optimize retrieval and generation strategy.
Outcome: The proposed framework outperforms strong agentic baselines on five knowledge-intensive QA benchmarks and improves training stability and generalization to multi-hop reasoning tasks.
DF-RAG: Query-Aware Diversity for Retrieval-Augmented Generation (2026.findings-eacl)

Copied to clipboard

Challenge: Retrieval-augmented generation (RAG) is a common technique for grounding language models in domain-specific information.
Approach: They propose a new retrieval technique that incorporates diversity into the retrieval step to improve performance on reasoning-intensive QA benchmarks.
Outcome: The proposed method outperforms baselines on reasoning-intensive QA benchmarks by 4–10%.
Test-Time Strategies for More Efficient and Accurate Agentic RAG (2026.acl-srw)

Copied to clipboard

Challenge: Retrieval-Augmented Generation (RAG) systems face challenges with complex, multi-hop questions.
Approach: They propose to integrate contextualization module and de-duplication module to improve the accuracy of retrieved documents and to reduce the number of turns by 10.5%.
Outcome: The proposed approach achieves a 5.6% increase in EM score and reduces the average number of turns by 10.5% compared to the baseline.
Query Decomposition for RAG: Balancing Exploration-Exploitation (2026.eacl-long)

Copied to clipboard

Challenge: Complex user queries often involve the exclusion of information, negation, or missing entities.
Approach: They propose to decompose user requests into subqueries, retrieve potentially relevant documents for each and then aggregate them to generate an answer.
Outcome: The proposed method achieves 35% gain in document-level precision and 15% increase in -nDCG . it also improves the downstream task of long-form generation.
HASH-RAG: Bridging Deep Hashing with Retriever for Efficient, Fine Retrieval and Augmented Generation (2025.findings-acl)

Copied to clipboard

Challenge: Experimental evaluations on NQ, TriviaQA, and HotpotQA datasets demonstrate that our approach achieves a 90% reduction in retrieval time compared to conventional methods while maintaining considerate recall performance.
Approach: They propose a framework that integrates deep hashing techniques with systematic optimizations to address these limitations.
Outcome: The proposed framework outperforms retrieval/non-retrieval baselines by 1.4-4.3% in EM scores on NQ, TriviaQA, and HotpotQA datasets.

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