Your Dense Retriever is Secretly an Expeditious Reasoner
Yichi Zhang, Jun Bai, Zhixin Cai, Shuhan Qin, Zhuofan Chen, Jinghua Guan, Wenge Rong
TL;DR
Dense retrievers excel at fast similarity search but falter on reasoning-heavy queries. AdaQR introduces a hybrid framework with a Dense Reasoner that imitates LLM reasoning in embedding space and a Reasoner Router that adaptively routes queries to either dense rewriting or full LLM reasoning, balancing efficiency and accuracy. On BRIGHT, AdaQR achieves an average $7.24\%$ improvement in retrieval performance while reducing reasoning cost by $28.12\%$ across multiple dense retrievers and LLMs, with domain-specific effects observed for LLM and dense rewrites. This approach offers a practical path to scalable, reasoning-aware retrieval in large-scale systems by leveraging latent transformations in embedding space plus adaptive decision-making.
Abstract
Dense retrievers enhance retrieval by encoding queries and documents into continuous vectors, but they often struggle with reasoning-intensive queries. Although Large Language Models (LLMs) can reformulate queries to capture complex reasoning, applying them universally incurs significant computational cost. In this work, we propose Adaptive Query Reasoning (AdaQR), a hybrid query rewriting framework. Within this framework, a Reasoner Router dynamically directs each query to either fast dense reasoning or deep LLM reasoning. The dense reasoning is achieved by the Dense Reasoner, which performs LLM-style reasoning directly in the embedding space, enabling a controllable trade-off between efficiency and accuracy. Experiments on large-scale retrieval benchmarks BRIGHT show that AdaQR reduces reasoning cost by 28% while preserving-or even improving-retrieval performance by 7%.
