mlsanityData to 14 Oct 2026

Pseudo Relevance Feedback is Enough to Close the Gap Between Small and Large Dense Retrieval Models

arXiv 2503.14887 ↗First posted 19 Mar 2025cs.IR cs.LGcited by 4

Not on the map. Why?

Abstract (arXiv)

Scaling dense retrievers to larger large language model (LLM) backbones has been a dominant strategy for improving their retrieval effectiveness. However, this has substantial cost implications: larger backbones require more expensive hardware (e.g. GPUs with more memory) and lead to higher indexing and querying costs (latency, energy consumption). In this paper, we challenge this paradigm by introducing PromptPRF, a feature-based pseudo-relevance feedback (PRF) framework that enables small LLM-based dense retrievers to achieve effectiveness comparable to much larger models. PromptPRF uses LLMs to extract query-independent, structured and unstructured features (e.g., entities, summaries, chain-of-thought keywords, essay) from top-ranked documents. These features are generated offline and integrated into dense query representations via prompting, enabling efficient retrieval without additional training. Unlike prior methods such as GRF, which rely on online, query-specific generation and sparse retrieval, PromptPRF decouples feedback generation from query processing and supports dense retrievers in a fully zero-shot setting. Experiments on TREC DL and BEIR benchmarks demonstrate that PromptPRF consistently improves retrieval effectiveness and offers favourable cost-effectiveness trade-offs. We further present ablation studies to understand the role of positional feedback and analyse the interplay between feature extractor size, PRF depth, and model performance. Our findings demonstrate that with effective PRF design, scaling the retriever is not always necessary, narrowing the gap between small and large models while reducing inference cost.

Key facts. Cited by 4 papers in the map (data through 14 Oct 2026). Builds on 19 of its 28 references that are in the map. First posted on arXiv 19 Mar 2025.

Builds on

19 of 28 references.

References · 19

  1. 2024The Llama 3 Herd of Modelscited by 14,715
  2. 2020Scaling Laws for Neural Language Modelscited by 6,586
  3. 2025DeepSeek-R1: Incentivizing Reasoning Capability in LLMs via Reinforcement Learningcited by 6,330
  4. 2020Dense Passage Retrieval for Open-Domain Question Answeringcited by 3,824
  5. 2021BEIR: A Heterogenous Benchmark for Zero-shot Evaluation of Information Retrieval Modelscited by 1,252
  6. 2020ColBERT: Efficient and Effective Passage Search via Contextualized Late Interaction over BERTcited by 1,178
  7. 2024LLM2Vec: Large Language Models Are Secretly Powerful Text Encoderscited by 404
  8. 2024Hybrid LLM: Cost-Efficient and Quality-Aware Query Routingcited by 372
  9. 2020Overview of the TREC 2019 deep learning trackcited by 286
  10. 2023Fine-Tuning LLaMA for Multi-Stage Text Retrievalcited by 272
  11. 2020Pretrained Transformers for Text Ranking: BERT and Beyondcited by 267
  12. 2021Overview of the TREC 2020 deep learning trackcited by 196
7 more
  1. 2023Llama2Vec: Unsupervised Adaptation of Large Language Models for Dense Retrievalcited by 78
  2. 2021Improving Query Representations for Dense Retrieval with Pseudo Relevance Feedbackcited by 47
  3. 2020BERT-QE: Contextualized Query Expansion for Document Re-rankingcited by 40
  4. 2023Generative Query Reformulation for Effective Adhoc Searchcited by 24
  5. 2021Improving Query Representations for Dense Retrieval with Pseudo Relevance Feedback: A Reproducibility Studycited by 13
  6. 2022To Interpolate or not to Interpolate: PRF, Dense and Sparse Retrieverscited by 12
  7. 2022How does Feedback Signal Quality Impact Effectiveness of Pseudo Relevance Feedback for Passage Retrieval?cited by 5

Built on by

Cited by year (2026 to 14 Oct)

Citing papers per year: 2025: 1; 2026: 3.

4 papers.

Similar, not cited

Close in wording, no citation either way

  1. 2025ExpandR: Teaching Dense Retrievers Beyond Queries with LLM Guidance
  2. 2022LED: Lexicon-Enlightened Dense Retriever for Large-Scale Retrieval
  3. 2026Mixture-of-Experts Language Models Can Be Strong and Efficient Retrievers
  4. 2026Embedding Surgery: Localized Updates for Adaptive Ranking Correction in Dense Retrieval
  5. 2025CSPLADE: Learned Sparse Retrieval with Causal Language Models
  6. 2026PRECISE: Reducing the Bias of LLM Evaluations Using Prediction-Powered Ranking Estimation
  7. 2025Learning Refined Document Representations for Dense Retrieval via Deliberate Thinking
  8. 2026Latent Terms: Dense Retrievers Contain Trivially Extractable BM25-ready Zipfian Vocabularies