arXiv:2607.10555cs.IRcs.AI2026-07

让大模型智能决定何时用工具,平衡检索准确与速度。

Tool-Adaptive LLM Reranker

论文配图:Tool-Adaptive LLM Reranker
图 1 · 摘自论文原文
  • 将重排过程建模为智能体决策问题,动态选择是否调用外部工具。
  • 在多个基准上达到顶尖性能,速度媲美普通重排模型。
  • 适合需要高精度且对延迟敏感的复杂查询场景。

生成式大语言模型虽革新了信息检索,但其固有的参数化特性在面对超出知识边界复杂查询时常产生严重事实幻觉。虽然外部工具调用可缓解此问题,但对每个文档无差别调用搜索工具会带来难以承受的延迟开销,造成准确率与效率的两难困境。为此,我们提出 TALRanker 框架,将点对点相关性评分形式化为智能体马尔可夫决策过程,并采用两阶段训练策略:初始阶段使用语言保持型混合损失防止原生生成能力的灾难性遗忘;随后在强化学习中引入非对称成本感知奖励,促使策略在自信时自主跳过工具以最大化效率,在不确定时选择性调用外部证据以避免严重幻觉惩罚。大量实验表明,TALRanker 在标准与推理密集型检索基准上均达到当前最优表现,其吞吐量与点对点重排器相当,同时优于参数庞大的推理模型。

原文摘要 · Abstract (English)

Generative Large Language Models (LLMs) have revolutionized information retrieval, yet their strictly parametric nature frequently leads to severe factual hallucinations when confronted with complex queries beyond their epistemic boundaries. While external tool-calling can mitigate this, indiscriminately invoking search tools for every document during reranking incurs prohibitive latency overheads, creating an intractable accuracy-efficiency dilemma. To address this challenge, we propose TALRanker, a novel framework that formalizes pointwise relevance scoring as an agentic Markov decision process. We optimize it via a two-stage training paradigm. An initial warm-up utilizes a language-preserving hybrid loss to prevent the catastrophic forgetting of native generative capacities. Subsequently, an asymmetric cost-aware reward equipped in reinforcement learning forces the policy to autonomously bypass tools for maximum efficiency when confident, while selectively retrieving external evidence to avert severe hallucination penalties when uncertain. Extensive evaluations demonstrate that TALRanker achieves state-of-the-art performance across standard and reasoning-intensive retrieval benchmarks, matching throughput with pointwise rerankers while outperforming parameter-heavy reasoning models.

大模型检索增强强化学习工具调用

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