arXiv:2605.02411cs.AIcs.IR2026-05中稿 · COLM

让智能体动态进化工具接口,提升复杂任务成功率。

FitText: Evolving Agent Tool Ecologies via Memetic Retrieval

论文配图:FitText: Evolving Agent Tool Ecologies via Memetic Retrieval
图 1 · 摘自论文原文
  • 通过生成和演化自然语言工具描述,动态优化搜索空间。
  • 在16464个API上达84.3%通过率,超越基线20+点。
  • 适合高阶多工具任务,尤其擅长纠错与模糊场景恢复。

高效推理不仅取决于答案路径的长短,更在于智能体是否在正确的动作空间中推理。随着API生态扩展至数万个端点,用户请求与工具文档间的语义鸿沟使这一问题日益突出:初始静态检索常在规划前即失败,仅靠强化规划也无法补救缺失工具。本文将此问题建模为预算约束下的测试时检索,提出无需训练的FitText框架,通过生成、精炼和演化自然语言伪工具描述作为检索探针,实现执行过程中的工具接口可重配置。该框架支持串行精炼、并行探索及演化式检索(Memetic Retrieval),引入进化选择、局部精炼与工具记忆机制,避免重复搜索。在StableToolBench(16,464个API)上,演化版FitText达到84.3%的综合通过率,相比静态检索提升26.7点,优于单次检索(+22.2)、重新调用(+23.2)和徐式根精炼(+27.5)。其优势随模型能力增强而扩大,在模糊多工具任务中表现尤为突出,能修复早期错误后重新找回正确工具。在40路并发下,批量耗时仅比单次执行高1.01倍,有效控制额外开销。

原文摘要 · Abstract (English)

Efficient reasoning is not only a matter of shortening an answer trace; for tool-using agents, it also depends on whether the agent is reasoning over the right action space. As API ecosystems scale to tens of thousands of endpoints, the semantic gap between user requests and tool documentation makes this problem concrete: static retrieval from the initial query can fail before planning begins, and stronger planning alone cannot recover a missing tool. We study this problem as budgeted test-time retrieval and introduce FitText, a training-free framework that makes the tool interface revisable during execution by generating, refining, and evolving natural-language pseudo-tool descriptions as retrieval probes. FitText supports serial refinement, parallel exploration, and Memetic Retrieval, which adds evolutionary selection, local refinement, and tool memory to avoid redundant search. On StableToolBench (16,464 APIs), Memetic FitText reaches an 84.3% pooled pass rate, improving +26.7 points over static retrieval, +22.2 over Single-Pass, +23.2 over Re-Invoke, and +27.5 over Xu-style root refinement. It leads on every evaluated current model, with gains growing alongside model capability, and produces the largest improvements on ambiguous multi-tool tasks where dynamic re-retrieval restores correct candidates after early mistakes. At 40-way concurrency, parallel population execution keeps batched wall-clock at 1.01x Single-Pass despite the added search work.

智能体工具检索动态优化演化算法

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