Breaking Boundaries in Retrieval Systems: Unsupervised Domain Adaptation with Denoise-Finetuning

0Citations
Citations of this article
6Readers
Mendeley users who have this article in their library.

Abstract

Dense retrieval models have exhibited remarkable effectiveness, but they rely on abundant labeled data and face challenges when applied to different domains. Previous domain adaptation methods have employed generative models to generate pseudo queries, creating pseudo datasets to enhance the performance of dense retrieval models. However, these approaches typically use unadapted rerank models, leading to potentially imprecise labels. In this paper, we demonstrate the significance of adapting the rerank model to the target domain prior to utilizing it for label generation. This adaptation process enables us to obtain more accurate labels, thereby improving the overall performance of the dense retrieval model. Additionally, by combining the adapted retrieval model with the adapted rerank model, we achieve significantly better domain adaptation results across three retrieval datasets. We release our code for future research.

Cite

CITATION STYLE

APA

Chen, C. W., Yang, C. W., Lin, C. Y., & Kao, H. Y. (2023). Breaking Boundaries in Retrieval Systems: Unsupervised Domain Adaptation with Denoise-Finetuning. In Findings of the Association for Computational Linguistics: EMNLP 2023 (pp. 1630–1642). Association for Computational Linguistics (ACL). https://doi.org/10.18653/v1/2023.findings-emnlp.110

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free