Challenge: Existing domain adaptation methods for dense retrieval models use unadapted rerank models, leading to imprecise labels.
Approach: They propose to adapt a rerank model to the target domain before using it for label generation.
Outcome: The proposed model achieves better results across three retrieval datasets.

Similar Papers

GPL: Generative Pseudo Labeling for Unsupervised Domain Adaptation of Dense Retrieval (2022.naacl-main)

Copied to clipboard

Challenge: Dense retrieval approaches suffer from the lexical gap and require large amounts of training data.
Approach: They propose an unsupervised method for domain adaptation that uses query generator and pseudo labeling from a cross-encoder to improve retrieval performance.
Outcome: The proposed method outperforms state-of-the-art retrieval methods on domain-specialized datasets by 9.3 points nDCG@10 on six tasks.
Domain Adaptation for Dense Retrieval and Conversational Dense Retrieval through Self-Supervision by Meticulous Pseudo-Relevance Labeling (2024.lrec-main)

Copied to clipboard

Challenge: Recent studies have shown that dense retrieval models generalize less well than interaction-based models on out-of-distribution data sets.
Approach: They propose to combine query-generation approach with self-supervision approach in which pseudo-relevance labels are automatically generated on the target domain.
Outcome: The proposed approach is based on a T5-3B model for pseudo-positive labeling and hard negatives on conversational dense retrieval models.
UDAPDR: Unsupervised Domain Adaptation via LLM Prompting and Distillation of Rerankers (2023.emnlp-main)

Copied to clipboard

Challenge: Existing methods for information retrieval tasks require large labeled datasets for fine-tuning, but they can experience significant drops in accuracy due to distribution shifts from the training to the target domain.
Approach: They propose a method for using large language models to generate large numbers of synthetic queries cheaply using an expensive LLM.
Outcome: The proposed method boosts zero-shot accuracy in long-tail domains and achieves substantially lower latency than standard reranking methods.
Fine-grained Knowledge Fusion for Sequence Labeling Domain Adaptation (D19-1)

Copied to clipboard

Challenge: Existing domain adaptation methods focus on the adaptation from the source domain to the entire target domain without considering the diversity of individual sample samples.
Approach: They propose a fine-grained knowledge fusion model with the domain relevance modeling scheme to control the balance between learning from the target domain data and learning from a source domain model.
Outcome: The proposed model outperforms baselines and state-of-the-art models on three sequence labeling tasks.
Neural Unsupervised Domain Adaptation in NLP—A Survey (2020.coling-main)

Copied to clipboard

Challenge: Deep neural networks excel at learning from labeled data, but learning from unlabeled data remains a challenge.
Approach: They review neural unsupervised domain adaptation techniques which do not require labeled target domain data.
Outcome: The proposed techniques are more challenging yet widely applicable.
DUQGen: Effective Unsupervised Domain Adaptation of Neural Rankers by Diversifying Synthetic Query Generation (2024.naacl-long)

Copied to clipboard

Challenge: State-of-the-art rankers pre-trained on large task-specific training data such as MS-MARCO exhibit strong performance on various ranking tasks without domain adaptation, also called zero-shot.
Approach: They propose a method to generate unsupervised domain adaptation for ranking using large-scale task-specific training data such as MS-MARCO and Wikipedia retrieval.
Outcome: The proposed method outperforms all zero-shot baselines and significantly outperfies the SOTA baselines on 16 out of 18 datasets, for an average of 4% relative improvement across all datasets.
Margin-aware Unsupervised Domain Adaptation for Cross-lingual Text Labeling (2020.findings-emnlp)

Copied to clipboard

Challenge: Existing approaches to learn a model from labeled data are expensive or prohibitive.
Approach: They propose an unsupervised domain adaptation algorithm that leverages labeled data in a source domain to learn a well-performing model in . they use the Margin Disparity Discrepancy algorithm to optimize the margin loss on the source domain.
Outcome: The proposed approach improves on a recent theoretical work on cross-lingual document classification and NER by a large margin.
tRAG: Term-level Retrieval-Augmented Generation for Domain-Adaptive Retrieval (2025.naacl-long)

Copied to clipboard

Challenge: Neural retrieval models suffer when there is a domain shift between training and test data distributions.
Approach: They propose to generate domain-adapted pseudo-queries using large language models (LLMs) to improve term recall of unseen query terms by using term-level Retrieval-Augmented Generation (tRAG).
Outcome: The proposed method significantly improves recall for unseen terms by 10.6% and outperforms LLM and retrieval-augmented generation baselines on overall retrieval performance.
Re3val: Reinforced and Reranked Generative Retrieval (2024.findings-eacl)

Copied to clipboard

Challenge: generative retrieval models encode pointers to information in a corpus as an index within the model’s parameters.
Approach: They propose a generative retrieval model that leverages contextual information to rerank retrieved page titles and utilizes REINFORCE to maximize rewards generated by constrained decoding.
Outcome: The proposed model can't be tuned for the downstream readers as decoding the page title is a non-differentiable operation.
A Fine-Grained Domain Adaption Model for Joint Word Segmentation and POS Tagging (2021.emnlp-main)

Copied to clipboard

Challenge: Experimental results show that joint models of word segmentation and POS tagging can lead to better performance because they are closely related.
Approach: They propose a domain adaption method for Chinese word segmentation and POS tagging that uses a simple metric to model the gaps between target and target domains.
Outcome: The proposed method can gain significant performance improvements over baselines on a benchmark dataset.

What is GenGO?

GenGO is an NLP powered publication search system. It currenctly indexes 30k+ papers from ACL Anthology, and implements multi-aspect summarization, semantic search, and more!

Information

About
Limitations