mlsanityData to 7 Oct 2026

Dense Retrieval Adaptation using Target Domain Description

arXiv 2307.02740 ↗First posted 6 Jul 2023cs.IR cs.CLcited by 8

Not on the map. Why?

Abstract (arXiv)

In information retrieval (IR), domain adaptation is the process of adapting a retrieval model to a new domain whose data distribution is different from the source domain. Existing methods in this area focus on unsupervised domain adaptation where they have access to the target document collection or supervised (often few-shot) domain adaptation where they additionally have access to (limited) labeled data in the target domain. There also exists research on improving zero-shot performance of retrieval models with no adaptation. This paper introduces a new category of domain adaptation in IR that is as-yet unexplored. Here, similar to the zero-shot setting, we assume the retrieval model does not have access to the target document collection. In contrast, it does have access to a brief textual description that explains the target domain. We define a taxonomy of domain attributes in retrieval tasks to understand different properties of a source domain that can be adapted to a target domain. We introduce a novel automatic data construction pipeline that produces a synthetic document collection, query set, and pseudo relevance labels, given a textual domain description. Extensive experiments on five diverse target domains show that adapting dense retrieval models using the constructed synthetic data leads to effective retrieval performance on the target domain.

Key facts. Cited by 8 papers in the map (data through 7 Oct 2026). Builds on 27 of its 59 references that are in the map. First posted on arXiv 6 Jul 2023.

Builds on

27 of 59 references.

References · 27

  1. 2018BERT: Pre-training of Deep Bidirectional Transformers for Language Understandingcited by 40,204
  2. 2014Adam: A Method for Stochastic Optimizationcited by 36,960
  3. 2020Language Models are Few-Shot Learnerscited by 32,199
  4. 2022Training language models to follow instructions with human feedbackcited by 15,712
  5. 2019Exploring the Limits of Transfer Learning with a Unified Text-to-Text Transformercited by 14,491
  6. 2019RoBERTa: A Robustly Optimized BERT Pretraining Approachcited by 13,266
  7. 2019Sentence-BERT: Sentence Embeddings using Siamese BERT-Networkscited by 9,049
  8. 2020Dense Passage Retrieval for Open-Domain Question Answeringcited by 3,779
  9. 2021Finetuned Language Models Are Zero-Shot Learnerscited by 3,747
  10. 2016MS MARCO: A Human Generated MAchine Reading COmprehension Datasetcited by 1,591
  11. 2021Multitask Prompted Training Enables Zero-Shot Task Generalizationcited by 1,462
  12. 2021BEIR: A Heterogenous Benchmark for Zero-shot Evaluation of Information Retrieval Modelscited by 1,225
15 more
  1. 2022Super-NaturalInstructions: Generalization via Declarative Instructions on 1600+ NLP Taskscited by 858
  2. 2020Approximate Nearest Neighbor Negative Contrastive Learning for Dense Text Retrievalcited by 846
  3. 2019Passage Re-ranking with BERTcited by 629
  4. 2020Fact or Fiction: Verifying Scientific Claimscited by 546
  5. 2022Precise Zero-Shot Dense Retrieval without Relevance Labelscited by 508
  6. 2020SPECTER: Document-level Representation Learning using Citation-informed Transformerscited by 426
  7. 2021Overview of the TREC 2020 deep learning trackcited by 193
  8. 2020CORD-19: The COVID-19 Open Research Datasetcited by 179
  9. 2021GPL: Generative Pseudo Labeling for Unsupervised Domain Adaptation of Dense Retrievalcited by 119
  10. 2022Task-aware Retrieval with Instructionscited by 107
  11. 2019A Deep Look into Neural Ranking Models for Information Retrievalcited by 79
  12. 2017Neural Ranking Models with Weak Supervisioncited by 61
  13. 2022InPars: Data Augmentation for Information Retrieval using Large Language Modelscited by 60
  14. 2022Curriculum Learning for Dense Retrieval Distillationcited by 38
  15. 2016What to do about non-standard (or non-canonical) language in NLPcited by 35

Built on by

Cited by year

Citing papers per year: 2024: 4; 2025: 4.

8 papers.