Reinforced Query Reasoners for Reasoning-intensive Retrieval Tasks (2025.emnlp-main)
Copied to clipboard
| Challenge: | Existing methods for retrieval of information excel at textual and semantic matching but struggle in reasoning-intensive retrieval tasks. |
| Approach: | They propose a family of small-scale language models for query reasoning and rewriting in reasoning-intensive retrieval. |
| Outcome: | The proposed model outperforms existing models on a BRIGHT benchmark with BM25 retrievers. |
Similar Papers
A Survey of Reasoning-Intensive Retrieval: Progress and Challenges (2026.acl-long)
Copied to clipboard
| Challenge: | Reasoning-Intensive Retrieval (RIR) targets retrieval settings where relevance is mediated by latent inferential links between a query and supporting evidence, rather than semantic similarity. |
| Approach: | They propose a taxonomy that categorizes methods based on where and how reasoning is integrated into the retrieval pipeline. |
| Outcome: | The proposed method framework provides a detailed analysis of the current landscape and its trade-offs and practical applications. |
One Refiner to Unlock Them All: Inference-Time Reasoning Elicitation via Reinforcement Query Refinement (2026.acl-long)
Copied to clipboard
| Challenge: | Existing alignment methods for Large Language Models (LLMs) are expensive and lack the flexibility to fully activate their latent reasoning capabilities. |
| Approach: | They propose a modular framework that treats reasoning elicitation as an inference-time alignment task. |
| Outcome: | The proposed framework outperforms baselines by 2.1% on average across diverse architectures and benchmarks. |
Making Large Language Models Efficient Dense Retrievers (2026.acl-long)
Copied to clipboard
| Challenge: | Recent studies have shown that fine-tuning large language models for dense retrieval yields strong performance, but their substantial parameter counts make them computationally inefficient. |
| Approach: | They propose a framework for developing efficient retrievers that performs coarse-to-fine compression through a coarse-grained coarse-tuning strategy. |
| Outcome: | The proposed framework reduces model size and inference cost while preserving performance of full-size models. |
PRCA: Fitting Black-Box Large Language Models for Retrieval Question Answering via Pluggable Reward-Driven Contextual Adapter (2023.emnlp-main)
Copied to clipboard
| Challenge: | Large Language Models (LLMs) are too large to be fine-tuned with budget constraints and some are only accessible via APIs. |
| Approach: | They propose a pluggable Reward-Driven Contextual Adapter that integrates large language models as generators and trains them to refine the retrieved information. |
| Outcome: | The proposed method improves ReQA performance on three datasets by up to 20% compared to existing methods. |
Query Rewriting in Retrieval-Augmented Large Language Models (2023.emnlp-main)
Copied to clipboard
| Challenge: | Existing studies focus on adapting either the retriever or the reader, but this approach is more focused on adaptation of the query itself. |
| Approach: | They propose a new framework for retrieval-augmented Large Language Models . they propose rewrite-retrieve-read instead of retrieve-then-read . |
| Outcome: | The proposed framework improves performance on downstream tasks, open-domain QA and multiple-choice QA. |
QueStER: Query Specification for Generative Keyword-Based Retrieval (2026.findings-eacl)
Copied to clipboard
| Challenge: | Generative retrieval (GR) models can be expensive and brittle out of domain. |
| Approach: | They propose a query specification for gEnerative Keyword-Based Retrieval which bridges GR and query reformulation by learning to generate explicit keyword-based search specifications. |
| Outcome: | The proposed query specification improves over existing queries and maintains strong efficiency. |
RaDeR: Reasoning-aware Dense Retrieval Models (2025.emnlp-main)
Copied to clipboard
| Challenge: | RaDeR retrievers outperform strong baselines in reasoning tasks . large language models (LLMs) have impressive reasoning capabilities on a wide range of tasks - however, they face challenges when reasoning is needed for relevance prediction. |
| Approach: | They propose a set of reasoning-based dense retrieval models trained with data derived from mathematical problem solving using large language models. |
| Outcome: | The proposed model outperforms baselines on the BRIGHT and RAR-b benchmarks and achieves comparable or superior performance while using only 2.5% of the training data used by the concurrent work ReasonIR. |
UR2 : Unify RAG and Reasoning through Reinforcement Learning (2026.acl-long)
Copied to clipboard
| Challenge: | Existing attempts to unify large language models are limited to open-domain QA with fixed retrieval settings. |
| Approach: | They propose a general reinforcement learning framework that dynamically coordinates retrieval and reasoning. |
| Outcome: | The proposed framework outperforms existing paradigms on open-domain QA, MMLU-Pro, medical, and mathematical reasoning tasks. |
ReasonEmbed: Enhanced Text Embeddings for Reasoning-Intensive Document Retrieval (2026.acl-long)
Copied to clipboard
| Challenge: | Recent studies suggest that traditional retrievers struggle with reasoningintensive tasks such as personal assistants and scientific research. |
| Approach: | They propose a new data synthesis method that overcomes the triviality problem prevalent in previous synthetic datasets and propose 'ReMixer', a data fusion method that generates 82K high-quality training samples. |
| Outcome: | The proposed model outperforms existing models on reasoning-intensive retrieval tasks. |
ExpandR: Teaching Dense Retrievers Beyond Queries with LLM Guidance (2025.emnlp-main)
Copied to clipboard
| Challenge: | Existing methods for enhancing dense retrieval with query augmentation ignore the alignment between generation and ranking objectives. |
| Approach: | They propose a unified LLM-augmented dense retrieval framework that jointly optimizes both the LLM and the retriever. |
| Outcome: | Experimental results show that ExpandR outperforms strong baselines, achieving more than 5% improvement in retrieval performance. |