arXiv:2605.28699cs.AI2026-05

让多个大模型协作推理,自动决定何时发言、说什么。

TRACER: Turn-level Regret Matching with Inner Reinforcement Credit for Cooperative Multi-LLM Reasoning

论文配图:TRACER: Turn-level Regret Matching with Inner Reinforcement Credit for Cooperative Multi-LLM Reasoning
图 1 · 摘自论文原文
  • 用博弈论思想控制发言时机,避免无效互动。
  • 在GSM8K等数据集上准确率超固定协议方法。
  • 适合研究可学习的智能体协作机制的人看。

大语言模型常通过强化学习或多智能体提示提升推理能力,但两者难以结合。直接将单智能体强化学习用于多轮多智能体系统面临三重困境:稀疏奖励、角色间搭便车、训练开销过大;智能体仅模仿协作;固定协作协议易陷入震荡局部最优。为此提出TRACER,一种面向合作式多大模型推理的回合级强化学习框架。该框架将协作决策分为控制器-后悔层(控制器通过后悔匹配决定是否发言)与生成-信用层(用角色特异性GSPO奖励优化发言内容)。此设计实现:① 在动作模式与生成语句层面分配信用,缓解搭便车与奖励稀疏问题;② 仅扩展控制器选择,显著降低训练计算成本;③ 通过巧妙设计二元动作,将经典有限动作空间博弈论拓展至深度学习,实现数学严谨收敛。在GSM8K训练集上训练,于保留测试集GSM8K、MATH500、GPQA-Diamond上评估,衡量领域内准确率、跨基准泛化性、推理成本及修正保留行为。结果表明,该框架提供了一个紧凑可复现的测试平台,可用于研究超越固定辩论、投票或聚合协议的可学习协作策略。代码已开源:https://github.com/Shark-Forest/TRACER。

原文摘要 · Abstract (English)

Large language models increasingly rely on either reinforcement learning or multi-agent prompting to improve reasoning, yet these two paradigms remain difficult to combine. Directly applying single-agent reinforcement learning to multi-turn multi-agent systems faces following dilemmas: i) Sparse rewards, role-level free-riding and excessive training overhead. ii) Agents only imitate to collaborate. iii) Fixed collaboration protocol falls into oscillating local optimum. We introduce TRACER, a turn-level reinforcement framework for cooperative multi-LLM reasoning. TRACER separates collaborative decision making into a controller-regret layer, where controllers learn whether the agents should speak or skip the current round through regret matching, and a generation-credit layer, which optimizes proposer and reviewer utterances with role-specific GSPO rewards. This design i) assigns credit at the level of both action modes and generated utterances, thus avoiding free-riding and sparse rewards. We only expand the choices made by the controllers, thus greatly reducing computational cost of training. Moreover, ii) agents acquire collaborative capability as they learn when to utter and what to speak. Finally, iii) by designing binary actions ingeniously, we extend classical game theory established for finite action spaces to deep learning, thus achieving mathematically rigorous convergence. We train all local RL-style methods on the GSM8K training split and evaluate on held-out GSM8K, MATH500, and GPQA-Diamond to measure in-domain accuracy, cross-benchmark generalization, inference cost, and correction-preservation behavior. The resulting framework provides a compact and reproducible testbed for studying learned collaboration policies beyond fixed debate, voting, or aggregation protocols. Code is available at https://github.com/Shark-Forest/TRACER.

多智能体强化学习协作推理

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