Succeeding at Scale: Enterprise Retrieval Benchmark Construction and Index-Preserving Query Adaptation for Multi-Tenant Search
Not on the map. Why?
Abstract (arXiv)
Large-scale multi-tenant retrieval systems generate extensive query logs but lack curated relevance labels for effective domain adaptation, resulting in substantial underutilized "dark data." This challenge is compounded by the high cost of model updates, as jointly fine-tuning query and document encoders requires full corpus re-indexing, which is impractical in multi-tenant settings with thousands of isolated indices. We introduce DevRev-Search, a passage retrieval benchmark for technical customer support built via a fully automated pipeline. Candidate generation uses fusion across diverse sparse and dense retrievers, followed by an LLM-as-a-Judge for consistency filtering and relevance labeling. We further study and systematically evaluate index-preserving query-only adaptation strategies that fine-tune only the query-encoder while keeping the document indices fixed. Experiments on DevRev-Search, SciFact, and FiQA-2018 show that parameter-efficient fine-tuning of the query encoder delivers a remarkable quality-efficiency trade-off, enabling scalable and practical enterprise multi-tenant retrieval.
Key facts. No citing papers in the map yet (data through 7 Oct 2026). Builds on 20 of its 39 references that are in the map. First posted on arXiv 8 Jan 2026.
Builds on
20 of 39 references.
References · 20
- 2019Parameter-Efficient Transfer Learning for NLPcited by 4,195
- 2020Dense Passage Retrieval for Open-Domain Question Answeringcited by 3,779
- 2015Delving Deep into Rectifiers: Surpassing Human-Level Performance on ImageNet Classificationcited by 3,590
- 2016Gaussian Error Linear Units (GELUs)cited by 3,431
- 2021BEIR: A Heterogenous Benchmark for Zero-shot Evaluation of Information Retrieval Modelscited by 1,225
- 2025Qwen3 Embedding: Advancing Text Embedding and Reranking Through Foundation Modelscited by 1,175
- 2016Efficient and robust approximate nearest neighbor search using Hierarchical Navigable Small World graphscited by 853
- 2020Approximate Nearest Neighbor Negative Contrastive Learning for Dense Text Retrievalcited by 846
- 2023Towards General Text Embeddings with Multi-stage Contrastive Learningcited by 705
- 2020Intrinsic Dimensionality Explains the Effectiveness of Language Model Fine-Tuningcited by 658
- 2022Surgical Fine-Tuning Improves Adaptation to Distribution Shiftscited by 205
- 2021GPL: Generative Pseudo Labeling for Unsupervised Domain Adaptation of Dense Retrievalcited by 119
8 more
- 2022SciFact-Open: Towards open-domain scientific claim verificationcited by 94
- 2022InPars: Data Augmentation for Information Retrieval using Large Language Modelscited by 60
- 2024Arctic-Embed 2.0: Multilingual Retrieval Without Compromisecited by 57
- 2021Improving Query Representations for Dense Retrieval with Pseudo Relevance Feedbackcited by 45
- 2024Don't Use LLMs to Make Relevance Judgmentscited by 26
- 2022Parameter-Efficient Neural Reranking for Cross-Lingual and Multilingual Retrievalcited by 17
- 2023Search-Adaptor: Embedding Customization for Information Retrievalcited by 10
- 2023Query Encoder Distillation via Embedding Alignment is a Strong Baseline Method to Boost Dense Retriever Online Efficiencycited by 5
Built on by
Not cited yet.