ADORE: Iterative Query Expansion with Retrieval-Grounded Relevance Feedback
Not on the map. Why?
Abstract (arXiv)
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.
Key facts. Cited by 1 paper in the map (data through 14 Oct 2026). Builds on 23 of its 36 references that are in the map. First posted on arXiv 11 Jun 2026.
Builds on
23 of 36 references.
References · 23
- 2020Dense Passage Retrieval for Open-Domain Question Answeringcited by 3,824
- 2021BEIR: A Heterogenous Benchmark for Zero-shot Evaluation of Information Retrieval Modelscited by 1,252
- 2021Unsupervised Dense Information Retrieval with Contrastive Learningcited by 1,216
- 2020Approximate Nearest Neighbor Negative Contrastive Learning for Dense Text Retrievalcited by 849
- 2023Towards General Text Embeddings with Multi-stage Contrastive Learningcited by 723
- 2023C-Pack: Packed Resources For General Chinese Embeddingscited by 578
- 2022Precise Zero-Shot Dense Retrieval without Relevance Labelscited by 517
- 2020Overview of the TREC 2019 deep learning trackcited by 286
- 2021Overview of the TREC 2020 deep learning trackcited by 196
- 2023RankZephyr: Effective and Robust Zero-Shot Listwise Reranking is a Breeze!cited by 155
- 2023Large language models can accurately predict searcher preferencescited by 131
- 2023Perspectives on Large Language Models for Relevance Judgmentcited by 85
11 more
- 2025ReasonIR: Training Retrievers for Reasoning Taskscited by 77
- 2024UMBRELA: UMbrela is the (Open-Source Reproduction of the) Bing RELevance Assessorcited by 42
- 2023One-Shot Labeling for Automatic Relevance Estimationcited by 31
- 2024LLM-based relevance assessment still can't replace human relevance assessmentcited by 27
- 2023Generative Query Reformulation for Effective Adhoc Searchcited by 24
- 2024GenQREnsemble: Zero-Shot LLM Ensemble Prompting for Generative Query Reformulationcited by 23
- 2024Synthetic Test Collections for Retrieval Evaluationcited by 19
- 2021How Deep is your Learning: the DL-HARD Annotated Deep Learning Datasetcited by 18
- 2025ThinkQE: Query Expansion via an Evolving Thinking Processcited by 12
- 2025QueryGym: A Toolkit for Reproducible LLM-Based Query Reformulationcited by 5
- 2026A Reproducibility Study of LLM-Based Query Reformulationcited by 2
Built on by
Citing papers per year: 2026: 1.
1 paper.