arXiv:2608.00030cs.CLcs.AI2026-08

用小模型动态选检索代理,让搜索更准更快。

SLMs as Multi-Agent Routers: A Progressive SFT and Reinforcement Learning Approach

  • 训练小模型联合选择代理并生成参数,基于内容相关性反馈优化决策。
  • 在错配场景下NDCG@10达0.918,优于两个大模型基线。
  • 适合需要精准路由与低延迟的智能搜索系统使用。

专用检索代理通常比通用搜索产生更高质量的结果,但为特定查询选择最优代理仍是开放问题。现有方法基于推断的主题或意图进行路由,但意图导向的选择存在根本局限:不纳入检索内容的信号,也无法识别主题匹配却产出低相关性结果的情况。本文提出一种渐进式微调与强化学习的方法,训练小型语言模型联合完成代理选择与下游工具调用的结构化参数生成,采用分层奖励函数,结合检索相关性与查询-代理主题一致性。该模型能从检索表现中学习任务相关的代理适用性:哪些代理对哪类查询更可靠,以及在表面主题重合时何时应避免使用专用代理。在一组典型代理-查询错配子集上,模型达到NDCG@10为0.918,显著优于两个仅依赖意图路由的LLM基线(Amazon Nova Lite为0.539,Claude Haiku 4.5为0.490)。整体平均NDCG@10为0.771(较Nova Lite提升0.177,较Haiku提升0.219),平均选择延迟为120.1ms,相比Nova Lite降低82.4%。

原文摘要 · Abstract (English)

Specialised retrieval agents typically surface higher quality results than general-purpose search, but selecting the optimal agent for a given query remains an open problem. Current approaches route queries based on inferred topic or intent, however intent-based selection is fundamentally limited: it does not incorporate signal from retrieved content, and cannot detect when a topically aligned agent produces low-relevance results. We address this by training a small language model via supervised fine-tuning followed by reinforcement learning to jointly perform agent selection and structured parameter generation for downstream tool calls, using a hierarchical reward function grounded in retrieval relevance along with query-agent topic alignment. This enables the model to learn task-dependent agent suitability from retrieval performance: which agents reliably yield high-relevance results for which query distributions, and when to redirect queries away from specialised agents despite surface-level topical overlap. On a targeted subset of such agent-query mismatches, the trained model achieves an NDCG@10 of 0.918 compared to 0.539 and 0.490 for two LLM baselines (Amazon Nova Lite and Claude Haiku 4.5) that route on intent alone. Overall, it achieves a mean NDCG@10 of 0.771 (+0.177 over Nova Lite, +0.219 over Haiku) with a mean selection latency of 120.1ms, an 82.4% reduction over Nova Lite.

多智能体路由优化强化学习检索增强

Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。