跳到正文

检索与重排序 · 2025

ReSLLM

利用语言模型为联邦检索选择资源,包括 SLAT 微调流程。

论文
ReSLLM — Figure 1 · Resource selection and fine-tuning
图 1 · 资源选择与微调 · 来源 ↗

摘要

Federated search, which involves integrating results from multiple independent search engines, will become increasingly pivotal in the context of Retrieval-Augmented Generation pipelines empowering LLM-based applications such as chatbots. These systems often distribute queries among various search engines, ranging from specialized (e.g., PubMed) to general (e.g., Google), based on the nature of user utterances. A critical aspect of federated search is resource selection - the selection of appropriate resources prior to issuing the query to ensure high-quality and rapid responses, and contain costs associated with calling the external search engines. However, current SOTA resource selection methodologies primarily rely on feature-based learning approaches. These methods often involve the labour intensive and expensive creation of training labels for each resource. In contrast, LLMs have exhibited strong effectiveness as zero-shot methods across NLP and IR tasks. We hypothesise that in the context of federated search LLMs can assess the relevance of resources without the need for extensive predefined labels or features. In this paper, we propose ReSLLM. Our ReSLLM method exploits LLMs to drive the selection of resources in federated search in a zero-shot setting. In addition, we devise an unsupervised fine tuning protocol, the Synthetic Label Augmentation Tuning (SLAT), where the relevance of previously logged queries and snippets from resources is predicted using an off-the-shelf LLM and then in turn used to fine-tune ReSLLM with respect to resource selection. Our empirical evaluation and analysis details the factors

相关论文

检索与重排序

检索与重排序 · 2026

DiffRetriever

利用扩散语言模型中并行的掩码位置,生成用于稠密与稀疏检索的多重表示。

检索与重排序 · 2026

Starbucks

在同一个检索模型中灵活调整嵌入维度与网络深度,扩展 Matryoshka 和 2D Matryoshka 训练。