Zero-Shot Dense Retrieval with Embeddings from Relevance Feedback
Not on the map. Why?
Abstract (arXiv)
Building effective dense retrieval systems remains difficult when relevance supervision is not available. Recent work has looked to overcome this challenge by using a Large Language Model (LLM) to generate hypothetical documents that can be used to find the closest real document. However, this approach relies solely on the LLM to have domain-specific knowledge relevant to the query, which may not be practical. Furthermore, generating hypothetical documents can be inefficient as it requires the LLM to generate a large number of tokens for each query. To address these challenges, we introduce Real Document Embeddings from Relevance Feedback (ReDE-RF). Inspired by relevance feedback, ReDE-RF proposes to re-frame hypothetical document generation as a relevance estimation task, using an LLM to select which documents should be used for nearest neighbor search. Through this re-framing, the LLM no longer needs domain-specific knowledge but only needs to judge what is relevant. Additionally, relevance estimation only requires the LLM to output a single token, thereby improving search latency. Our experiments show that ReDE-RF consistently surpasses state-of-the-art zero-shot dense retrieval methods across a wide range of low-resource retrieval datasets while also making significant improvements in latency per-query.
Key facts. Cited by 3 papers in the map (data through 14 Oct 2026). Builds on 27 of its 38 references that are in the map. First posted on arXiv 28 Oct 2024.
Builds on
27 of 38 references.
References · 27
- 2018BERT: Pre-training of Deep Bidirectional Transformers for Language Understandingcited by 40,399
- 2014Adam: A Method for Stochastic Optimizationcited by 37,240
- 2020Dense Passage Retrieval for Open-Domain Question Answeringcited by 3,824
- 2022FlashAttention: Fast and Memory-Efficient Exact Attention with IO-Awarenesscited by 3,673
- 2023Lost in the Middle: How Language Models Use Long Contextscited by 3,455
- 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
- 2022Precise Zero-Shot Dense Retrieval without Relevance Labelscited by 517
- 2020RocketQA: An Optimized Training Approach to Dense Passage Retrieval for Open-Domain Question Answeringcited by 413
- 2020Document Ranking with a Pretrained Sequence-to-Sequence Modelcited by 376
- 2023Trusting Your Evidence: Hallucinate Less with Context-aware Decodingcited by 327
15 more
- 2020Overview of the TREC 2019 deep learning trackcited by 286
- 2020Pretrained Transformers for Text Ranking: BERT and Beyondcited by 267
- 2022Promptagator: Few-shot Dense Retrieval From 8 Examplescited by 235
- 2021Overview of the TREC 2020 deep learning trackcited by 196
- 2020Generation-Augmented Retrieval for Open-domain Question Answeringcited by 186
- 2023Large language models can accurately predict searcher preferencescited by 131
- 2023Beyond Yes and No: Improving Zero-Shot LLM Rankers via Scoring Fine-Grained Relevance Labelscited by 86
- 2023InPars-v2: Large Language Models as Efficient Dataset Generators for Information Retrievalcited by 73
- 2022Questions Are All You Need to Train a Dense Passage Retrievercited by 47
- 2024PromptReps: Prompting Large Language Models to Generate Dense and Sparse Representations for Zero-Shot Document Retrievalcited by 30
- 2024Ask Optimal Questions: Aligning Large Language Models with Retriever's Preference in Conversationcited by 23
- 2024Constructing Benchmarks and Interventions for Combating Hallucinations in LLMscited by 19
- 2023Expand, Rerank, and Retrieve: Query Reranking for Open-Domain Question Answeringcited by 15
- 2024LLMs Can Patch Up Missing Relevance Judgments in Evaluationcited by 12
- 2024SoftQE: Learned Representations of Queries Expanded by LLMscited by 1
Built on by
Citing papers per year: 2024: 1; 2025: 1; 2026: 1.
3 papers.