ADORE: Iterative Query Expansion with Retrieval-Grounded Relevance Feedback

• URL: http://arxiv.org/abs/2606.13905v1
• Date: Thu, 11 Jun 2026 20:52:37 GMT
• Title: ADORE: Iterative Query Expansion with Retrieval-Grounded Relevance Feedback
• Abstract summary: We argue that effective expansion requires retrieval-grounded feedback, not just single-pass generation or unverified iteration.<n>We introduce ADORE, an iterative framework that turns retrieval outcomes into feedback for the next expansion.<n>Across TREC Deep Learning, BEIR, and BRIGHT, ADORE consistently outperforms strong query expansion baselines.
• Score: 22.297275934519345
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: LLM-based query expansion improves retrieval by enriching the original query with additional context. Yet most methods remain generation-driven, producing plausible pseudo-documents or expansions without checking how the target corpus responds. This can introduce retrieval drift, amplify misleading vocabulary, or miss terms that distinguish relevant from non-relevant documents. We argue that effective expansion requires retrieval-grounded feedback, not just single-pass generation or unverified iteration. We introduce ADORE (ADapt, Observe, Relevance Evaluate), an iterative framework that turns retrieval outcomes into feedback for the next expansion. At each round, an LLM generates pseudo-passages, a retriever exposes the corpus response, and a relevance assessor evaluates retrieved documents against the original query. These judgments identify what to reinforce, what remains undercovered, and what to suppress. Across TREC Deep Learning, BEIR, and BRIGHT, ADORE consistently outperforms strong query expansion baselines with notable improvements across nearly all evaluation settings, improving average nDCG@10 by 24.5% over BM25 and 3.6% over the strongest prior query expansion method on BEIR, and by 122.9% over BM25 and 9.2% over the best query expansion baseline on BRIGHT. Our code and data are publicly available.

Related papers

• Query Expansion Is More Than Generation: Improving Dense Retrieval through Better Integration [23.549376415069418]
  We introduce AnchorQE, a training-free method that encodes the original query and its expansion before interpolating them.<n>We show that AnchorQE improves retrieval effectiveness by up to 12.89% when compared to widely-used expansion-only or text-level concatenation baselines.
  arXiv  Detail & Related papers  (2026-08-26T08:30:32Z)
• Dense Expands, Sparse Anchors: Channel-Asymmetric Query Expansion for Hybrid Retrieval [0.0]
  We introduce DESA (Dense Expansion and Sparse Anchoring), a channel-asymmetric query expansion method.<n> DESA improves nDCG@10 and Recall@20 over the unexpanded query by 3.82% and 2.38%, while reducing dense and sparse access depths by 36.90% and 36.56%.<n>These results support channel-specific integration of generated passages and joint evaluation of retrieval effectiveness and access depth.
  arXiv  Detail & Related papers  (2026-08-16T16:43:49Z)
• Superintelligent Retrieval Agent: The Next Frontier of Information Retrieval [25.731213365755234]
  We introduce textitSuperIntelligent Retrieval Agent (SIRA)<n>SIRA can compress multi-round exploratory search into a single corpus-discriminative retrieval action.<n>It can exceed substantially more expensive multi-round search while remaining interpretable, training-free, and efficient.
  arXiv  Detail & Related papers  (2026-05-07T17:54:29Z)
• Query Decomposition for RAG: Balancing Exploration-Exploitation [83.79639293409802]
  RAG systems address complex user requests by decomposing them into subqueries, retrieving potentially relevant documents for each, and then aggregating them to generate an answer.<n>We formulate query decomposition and document retrieval in an exploitation-exploration setting, where retrieving one document at a time builds a belief about the utility of a given sub-queries.<n>Our main finding is that estimating document relevance using rank information and human judgments yields a 35% gain in document-level precision, 15% increase in alpha-nDCG, and better performance on the downstream task of long-form generation.
  arXiv  Detail & Related papers  (2025-10-21T13:37:11Z)
• Reasoning-enhanced Query Understanding through Decomposition and Interpretation [87.56450566014625]
  ReDI is a Reasoning-enhanced approach for query understanding through Decomposition and Interpretation.<n>We compiled a large-scale dataset of real-world complex queries from a major search engine.<n> Experiments on BRIGHT and BEIR demonstrate that ReDI consistently surpasses strong baselines in both sparse and dense retrieval paradigms.
  arXiv  Detail & Related papers  (2025-09-08T10:58:42Z)
• Aligned Query Expansion: Efficient Query Expansion for Information Retrieval through LLM Alignment [4.21943400140261]
  Aligned Query Expansion (AQE) is a novel approach to enhance query expansion for passage retrieval in open-domain question answering.<n>We show that AQE outperforms baseline models for query expansion in both in-domain and out-of-domain settings.
  arXiv  Detail & Related papers  (2025-07-15T07:11:29Z)
• Chain of Retrieval: Multi-Aspect Iterative Search Expansion and Post-Order Search Aggregation for Full Paper Retrieval [68.71038700559195]
  Chain of Retrieval(COR) is a novel iterative framework for full-paper retrieval.<n>We present SCIBENCH, a benchmark providing both complete and segmented contexts of full papers for queries and candidates.
  arXiv  Detail & Related papers  (2025-07-14T08:41:53Z)
• InsertRank: LLMs can reason over BM25 scores to Improve Listwise Reranking [3.1125398490785217]
  InsertRank is an LLM-based reranker that leverages lexical signals like BM25 scores during reranking to further improve retrieval performance.<n>With Deepseek-R1, InsertRank achieves a score of 37.5 on the BRIGHT benchmark, and 51.1 on the R2MED benchmark, surpassing previous methods.
  arXiv  Detail & Related papers  (2025-06-17T01:04:45Z)
• ThinkQE: Query Expansion via an Evolving Thinking Process [18.170948352149292]
  ThinkQE is a test-time query expansion framework that encourages deeper and comprehensive semantic exploration.<n>We show ThinkQE consistently outperforms prior approaches, including training-intensive dense retrievers and rerankers.
  arXiv  Detail & Related papers  (2025-06-10T21:41:01Z)
• Exp4Fuse: A Rank Fusion Framework for Enhanced Sparse Retrieval using Large Language Model-based Query Expansion [0.0]
  Large Language Models (LLMs) have shown potential in generating hypothetical documents for query expansion.<n>We introduce a novel fusion ranking framework, Exp4Fuse, which enhances the performance of sparse retrievers.
  arXiv  Detail & Related papers  (2025-06-05T08:44:34Z)
• BRIGHT: A Realistic and Challenging Benchmark for Reasoning-Intensive Retrieval [54.54576644403115]
  We introduce BRIGHT, the first text retrieval benchmark that requires intensive reasoning to retrieve relevant documents.<n>Our dataset consists of 1,384 real-world queries spanning diverse domains, such as economics, psychology, mathematics, and coding.<n>We show that incorporating explicit reasoning about the query improves retrieval performance by up to 12.2 points.
  arXiv  Detail & Related papers  (2024-07-16T17:58:27Z)
• When do Generative Query and Document Expansions Fail? A Comprehensive Study Across Methods, Retrievers, and Datasets [69.28733312110566]
  We conduct the first comprehensive analysis of LM-based expansion. We find that there exists a strong negative correlation between retriever performance and gains from expansion. Our results suggest the following recipe: use expansions for weaker models or when the target dataset significantly differs from training corpus in format.
  arXiv  Detail & Related papers  (2023-09-15T17:05:43Z)
• Query2doc: Query Expansion with Large Language Models [69.9707552694766]
  The proposed method first generates pseudo- documents by few-shot prompting large language models (LLMs) query2doc boosts the performance of BM25 by 3% to 15% on ad-hoc IR datasets. Our method also benefits state-of-the-art dense retrievers in terms of both in-domain and out-of-domain results.
  arXiv  Detail & Related papers  (2023-03-14T07:27:30Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.