Back to Basics: A Simple Recipe for Improving Out-of-Domain Retrieval in Dense Encoders
Not on the map. Why?
Abstract (arXiv)
Prevailing research practice today often relies on training dense retrievers on existing large datasets such as MSMARCO and then experimenting with ways to improve zero-shot generalization capabilities to unseen domains. While prior work has tackled this challenge through resource-intensive steps such as data augmentation, architectural modifications, increasing model size, or even further base model pretraining, comparatively little investigation has examined whether the training procedures themselves can be improved to yield better generalization capabilities in the resulting models. In this work, we recommend a simple recipe for training dense encoders: Train on MSMARCO with parameter-efficient methods, such as LoRA, and opt for using in-batch negatives unless given well-constructed hard negatives. We validate these recommendations using the BEIR benchmark and find results are persistent across choice of dense encoder and base model size and are complementary to other resource-intensive strategies for out-of-domain generalization such as architectural modifications or additional pretraining. We hope that this thorough and impartial study around various training techniques, which augments other resource-intensive methods, offers practical insights for developing a dense retrieval model that effectively generalizes, even when trained on a single dataset.
Key facts. Cited by 1 paper in the map (data through 7 Oct 2026). Builds on 42 of its 73 references that are in the map. First posted on arXiv 16 Nov 2023.
Builds on
42 of 73 references.
References · 42
- 2018BERT: Pre-training of Deep Bidirectional Transformers for Language Understandingcited by 40,204
- 2021LoRA: Low-Rank Adaptation of Large Language Modelscited by 14,084
- 2019RoBERTa: A Robustly Optimized BERT Pretraining Approachcited by 13,266
- 2019Parameter-Efficient Transfer Learning for NLPcited by 4,195
- 2023QLoRA: Efficient Finetuning of Quantized LLMscited by 3,355
- 2019HuggingFace's Transformers: State-of-the-art Natural Language Processingcited by 2,201
- 2016MS MARCO: A Human Generated MAchine Reading COmprehension Datasetcited by 1,591
- 2018FEVER: a large-scale dataset for Fact Extraction and VERificationcited by 1,362
- 2021BitFit: Simple Parameter-efficient Fine-tuning for Transformer-based Masked Language-modelscited by 1,234
- 2021BEIR: A Heterogenous Benchmark for Zero-shot Evaluation of Information Retrieval Modelscited by 1,225
- 2021Unsupervised Dense Information Retrieval with Contrastive Learningcited by 1,203
- 2020ColBERT: Efficient and Effective Passage Search via Contextualized Late Interaction over BERTcited by 1,160
30 more
- 2022Few-Shot Parameter-Efficient Fine-Tuning is Better and Cheaper than In-Context Learningcited by 886
- 2020Fact or Fiction: Verifying Scientific Claimscited by 546
- 2021Sentence-T5: Scalable Sentence Encoders from Pre-trained Text-to-Text Modelscited by 462
- 2021Large Dual Encoders Are Generalizable Retrieverscited by 454
- 2020SPECTER: Document-level Representation Learning using Citation-informed Transformerscited by 426
- 2023Augmented Language Models: a Surveycited by 398
- 2022Text and Code Embeddings by Contrastive Pre-Trainingcited by 358
- 2023Fine-Tuning LLaMA for Multi-Stage Text Retrievalcited by 271
- 2023LongLoRA: Efficient Fine-tuning of Long-Context Large Language Modelscited by 243
- 2022Promptagator: Few-shot Dense Retrieval From 8 Examplescited by 233
- 2020CLIMATE-FEVER: A Dataset for Verification of Real-World Climate Claimscited by 195
- 2021RocketQAv2: A Joint Training Method for Dense Passage Retrieval and Passage Re-rankingcited by 175
- 2021Towards Continual Knowledge Learning of Language Modelscited by 172
- 2020Answering Complex Open-Domain Questions with Multi-Hop Dense Retrievalcited by 160
- 2023QA-LoRA: Quantization-Aware Low-Rank Adaptation of Large Language Modelscited by 154
- 2021SPLADE v2: Sparse Lexical and Expansion Model for Information Retrievalcited by 126
- 2023How to Train Your DRAGON: Diverse Augmentation Towards Generalizable Dense Retrievalcited by 116
- 2021Lifelong Pretraining: Continually Adapting Language Models to Emerging Corporacited by 114
- 2022InPars: Data Augmentation for Information Retrieval using Large Language Modelscited by 60
- 2021Multi-task Retrieval for Knowledge-Intensive Taskscited by 44
- 2023UDAPDR: Unsupervised Domain Adaptation via LLM Prompting and Distillation of Rerankerscited by 37
- 2023Rethinking the Role of Token Retrieval in Multi-Vector Retrievalcited by 28
- 2023When do Generative Query and Document Expansions Fail? A Comprehensive Study Across Methods, Retrievers, and Datasetscited by 25
- 2022A Thorough Examination on Zero-shot Dense Retrievalcited by 21
- 2022In Defense of Cross-Encoders for Zero-Shot Retrievalcited by 21
- 2022Parameter-Efficient Prompt Tuning Makes Generalized and Calibrated Neural Text Retrieverscited by 18
- 2022Parameter-Efficient Neural Reranking for Cross-Lingual and Multilingual Retrievalcited by 17
- 2022Nonparametric Decoding for Generative Retrievalcited by 6
- 2023Exploring the Practicality of Generative Retrieval on Dynamic Corporacited by 6
- 2023Parameter-Efficient Sparse Retrievers and Rerankers using Adapterscited by 3
Built on by
Citing papers per year: 2025: 1.
1 paper.