Challenge: Existing methods focus on diversity but fail to capture model uncertainty.
Approach: They propose a method to generalize neural retrievers to an unseen domain by generating pseudo queries on target domain documents.
Outcome: The proposed method improves performance on large datasets with small and large models while limiting the learning utility of the current model.

Similar Papers

Breaking Boundaries in Retrieval Systems: Unsupervised Domain Adaptation with Denoise-Finetuning (2023.findings-emnlp)

Copied to clipboard

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.
Contextual Relevance and Adaptive Sampling for LLM-Based Document Reranking (2026.acl-long)

Copied to clipboard

Challenge: identifying relevant documents for Reasoning-intensive queries remains a challenge . large language models have shown strong performance in zero-shot document reranking .
Approach: They propose a reranking algorithm that estimates contextual relevance by aggregating LLMs' relevance judgments across batches.
Outcome: The proposed algorithm improves nDCG@10 over retrieval and reranking baselines by 15% and 6–21% respectively.
Relevance-assisted Generation for Robust Zero-shot Retrieval (2023.emnlp-industry)

Copied to clipboard

Challenge: Despite strong in-domain performance, dense retrievers have shown poor generalization to out-of-domain zero-shot tasks where no training queries are available.
Approach: They propose to generate domain-specific pseudo queries for fine-tuning with domain-relevant relevance between PQ and documents.
Outcome: The proposed approach is more robust to domain shifts, validated on BEIR zero-shot tasks.
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.
CAPSTONE: Curriculum Sampling for Dense Retrieval with Document Expansion (2023.emnlp-main)

Copied to clipboard

Challenge: Experimental results show that dense retrieval models are better at obtaining query-informed representations.
Approach: They propose a dual-encoder approach that computes latent representations of query and document independently, but inference replaces the real query with a generated one.
Outcome: The proposed approach outperforms previous dense retrieval models on in-domain and out-of-domain datasets.
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.
Self-Training Sampling with Monolingual Data Uncertainty for Neural Machine Translation (2021.acl-long)

Copied to clipboard

Challenge: Experimental results show that enhancing the learning on uncertain monolingual sentences improves the translation quality of high-uncertainty sentences and also benefits the prediction of low-frequency words at the target side.
Approach: They propose to use monolingual data to augment model training with synthetic parallel data by selecting the most informative monolingual sentences to complement the parallel data.
Outcome: The proposed approach improves the performance of natural language models by selecting the most informative monolingual sentences.
DADA: Distribution-Aware Domain Adaptation of PLMs for Information Retrieval (2024.findings-acl)

Copied to clipboard

Challenge: Pre-trained language models struggle with out-of-domain data due to distribution shifts . generative domain adaptation (DA) methods have been proposed to address these issues .
Approach: They propose a distribution-aware domain adaptation method to address distribution shifts in domains . they use observation-level feedback and observation- level feedback to adapt to the target domain .
Outcome: The proposed method adapts to the domain distribution knowledge at the level of a single document and the corpus and expands document representation to unseen gold query terms using domain and observation feedback.
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.
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.

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