arXiv:2604.25917cs.AIcs.CL2026-04被引 4

让多个智能体像递归计算一样协作,提升推理效率与准确率

Recursive Multi-Agent Systems

论文配图:Recursive Multi-Agent Systems
图 1 · 摘自论文原文
  • 构建递归多智能体系统,通过轻量模块实现跨智能体状态传递
  • 平均准确率提升8.3%,推理速度加快1.2到2.4倍,耗 token 减少34.6%至75.6%
  • 适合需要高效协同推理的任务,如数学、医学、代码生成等

递归语言模型通过在隐空间中迭代优化计算,实现了新的扩展路径。本文将这一思想拓展至多智能体系统,探索智能体协作本身能否通过递归进行扩展。为此,提出 RecursiveMAS 框架,将整个系统视为统一的隐空间递归计算过程。通过轻量级 RecursiveLink 模块连接异构智能体,实现分布内隐思维生成与跨智能体状态传递。为优化该框架,设计内外层循环学习算法,基于共享梯度分配实现递归轮次中的全系统联合优化。理论分析表明,RecursiveMAS 的运行时复杂度更低,且递归训练中梯度更稳定。实证上,在4种典型协作模式下于9个基准任务(涵盖数学、科学、医学、搜索和代码生成)上评估,相比先进单/多智能体及递归计算基线,平均准确率提升8.3%,端到端推理速度提升1.2–2.4倍,令牌使用量减少34.6%–75.6%。代码与数据已公开于 https://recursivemas.github.io。

原文摘要 · Abstract (English)

Recursive or looped language models have recently emerged as a new scaling axis by iteratively refining the same model computation over latent states to deepen reasoning. We extend such scaling principle from a single model to multi-agent systems, and ask: Can agent collaboration itself be scaled through recursion? To this end, we introduce RecursiveMAS, a recursive multi-agent framework that casts the entire system as a unified latent-space recursive computation. RecursiveMAS connects heterogeneous agents as a collaboration loop through the lightweight RecursiveLink module, enabling in-distribution latent thoughts generation and cross-agent latent state transfer. To optimize our framework, we develop an inner-outer loop learning algorithm for iterative whole-system co-optimization through shared gradient-based credit assignment across recursion rounds. Theoretical analyses of runtime complexity and learning dynamics establish that RecursiveMAS is more efficient than standard text-based MAS and maintains stable gradients during recursive training. Empirically, we instantiate RecursiveMAS under 4 representative agent collaboration patterns and evaluate across 9 benchmarks spanning mathematics, science, medicine, search, and code generation. In comparison with advanced single/multi-agent and recursive computation baselines, RecursiveMAS consistently delivers an average accuracy improvement of 8.3%, together with 1.2$\times$-2.4$\times$ end-to-end inference speedup, and 34.6%-75.6% token usage reduction. Code and Data are provided in https://recursivemas.github.io.

多智能体递归计算协同推理

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