Pith. sign in

REVIEW 3 cited by

Back to Basics: A Simple Recipe for Improving Out-of-Domain Retrieval in Dense Encoders

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2311.09765 v1 pith:DFZCAWCO submitted 2023-11-16 cs.IR cs.AI

classification cs.IRcs.AI
keywords densemodeltraininggeneralizationresource-intensivearchitecturalbasecapabilities
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

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.

Discussion (0). Sign in to comment.

Forward citations

Cited by 3 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Temporal Information Retrieval via Time-Specifier Model Merging

    cs.IR 2025-07 conditional novelty 6.0 of 10

    TSM trains one retriever per time specifier and merges them by parameter averaging, improving temporal retrieval while maintaining non-temporal retrieval.

  2. Dynamic Injection of Entity Knowledge into Dense Retrievers

    cs.CL 2025-07 conditional novelty 6.0 of 10

    KPR injects frozen Wikipedia-derived entity embeddings into a BERT retriever through a context-entity attention layer, improving retrieval accuracy on rare-entity queries.

  3. BAR Conjecture: the Feasibility of Inference Budget-Constrained LLM Services with Authenticity and Reasoning

    cs.LG 2025-07 reject novelty 2.0 of 10

    A purported impossibility theorem for LLM services reduces to the paper's own assumption that reasoning and authenticity necessarily consume extra inference budget.

Pith tools