UDAPDR: Unsupervised Domain Adaptation via LLM Prompting and Distillation of Rerankers
원문 초록
Many information retrieval tasks require large labeled datasets for fine-tuning. However, such datasets are often unavailable, and their utility for real-world applications can diminish quickly due to domain shifts. To address this challenge, we develop and motivate a method for using large language models (LLMs) to generate large numbers of synthetic queries cheaply. The method begins by generating a small number of synthetic queries using an expensive LLM. After that, a much less expensive one is used to create large numbers of synthetic queries, which are used to fine-tune a family of reranker models. These rerankers are then distilled into a single efficient retriever for use in the target domain. We show that this technique boosts zero-shot accuracy in long-tail domains and achieves substantially lower latency than standard reranking methods.
함께 살펴볼 논문
공통 태그를 근거로 연결했습니다. 실제 인용 관계나 논문의 우수성을 뜻하지 않습니다.
JointRank: Rank Large Set with Single Pass
InsertRank: LLMs can reason over BM25 scores to Improve Listwise Reranking
Hierarchical Multi-Positive Contrastive Learning for Patent Image Retrieval
Efficiency-Effectiveness Reranking FLOPs for LLM-based Rerankers
Topology-Aware Modeling for Unsupervised Simulation-to-Reality Point Cloud Recognition
Unlocking Constraints: Source-Free Occlusion-Aware Seamless Segmentation
토론
이 논문과 연결된 포럼 글이 아직 없습니다.