Jul 2026· Annual International ACM SIGIR Conference on Research and Development in Information Retrieval· pp. 4706-4710· 0 citations· 17 references
Computer Science
TL;DR
It is found that when pretraining data is limited, task-specific fine-tuning—using only a few hundred labeled examples in the domain—can match or surpass the gains of domain-adaptive pretraining, suggesting that domain-adaptive pretraining may not always be necessary for strong domain performance.
Abstract
Two-stage retrieval pipelines, where a fast retriever identifies candidates and then a more powerful reranker scrutinizes them, have become standard across retrieval-based applications, including open-domain question answering and retrieval-augmented generation systems. In specialized domains or low-resource languages, domain adaptation is often required to ensure retrieval quality. In this paper, we explore domain adaptation of rerankers using unlabeled and labeled, real and synthetic datasets across legal, biomedical, and auditing domains. In the domains we study, we find that when pretraining data is limited, task-specific fine-tuning—using only a few hundred labeled examples in the domain—can match or surpass the gains of domain-adaptive pretraining, suggesting that domain-adaptive pretraining may not always be necessary for strong domain performance. We further evaluate this on two industrial Japanese datasets, where we observe practical improvements with purely synthetic training data.
The main implication of this research is the validation of a practical architecture for improving IR systems, offering a viable alternative for domain-specific contexts such as Sequran.
Ray Ramadita, Wisnu Uriawan, W. Zulfikar· 0 citations
We introduce SciRet, a compute-aware empirical study of retrieval-augmented generation for scientific question answering over CORD-19. Rather than proposing a new model, we evaluate a fixed scientific RAG pipeline across three corpus scales: 1,034 chunks (1K papers), 5,160 chunks (5K papers), and 15,480 chunks (15K pap...
Kaysarul Anas Apurba, Mahade Hasan, Rofiqul Alam Shehab et al.· 0 citations
The findings indicate that domain-specialized models improve in-domain retrieval relative to generic models, and that systematic optimization through the multi-stage pipeline yields measurable gains in retrieval precision.
Savaş Yıldırım, Mucahit Cevik, Ayşe Başar· SN Computer Science· 0 citations
This work introduces AnchorQE, a training-free method that separately encodes the original query and its expansion before interpolating them, and shows that AnchorQE improves retrieval effectiveness by up to 12.89% when compared to widely-used expansion-only or text-level concatenation baselines across TREC-DL, LoTTE,...
The number of experts used for query encoding can be reduced without retraining or re-indexing, retaining more than 99% of retrieval effectiveness while reducing query encoding time by up to 26%.
Anubhav Shrestha, Safal Shrestha, Minwu Kim et al.· 0 citations
This work proposes PAO (Positive-Advantage-Only), a selective RL optimization method that selectively applies gradient updates only to retrieved items with positive advantages, effectively pulling query embed- dings toward high-reward regions while preserving global topo- logical stability.
Shao-Wei Wei, Chong Huang, Songtao Fang et al.· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.