首页 > AI前沿 > RAGCompass: Generalizable Retriever Routing via Reranking

RAGCompass: Generalizable Retriever Routing via Reranking

arXiv自然语言 2026-11-04 04:36 4 阅读 查看原文

Different retrievers exist for retrieval-augmented generation, yet none performs best for all queries. Therefore, the key question is: given a query and retrieved passages from different retrievers, which one is most suited for that query?

现有路由器的局限性

Existing routers usually make predictions from query-specific features and a fixed pool of retrievers; such routers have no output for an unseen retriever and are incapable by design on a new corpus.

RAGCompass的设计思路

To fill these gaps, RAGCompass reads the retrieved passage sets themselves: passages from an unfamiliar retriever or corpus stay directly comparable to other passages, so routing stays well designed where a query-only map would fail.

方法的具体组件与增益

We contrastively fine-tune a reranker against the answer each evidence set produces, which accounts for most of the gain; a small comparison head adds a moderate improvement, and neither component has retriever-specific parameters.

实验结果与泛化能力

RAGCompass improves answer F1 by 28% relative to the best fixed retriever, and outperforms fusion baselines, three query-only routers, and a prompted 8B language model.

Generalization experiments show that RAGCompass keeps most of its gain under an unseen corpus, retrieve