Newest papers

Local Work, Global Progress: A Convergence Theory of AI Agent Collaboration

Ivan Ilin, Peter Richtárik · 2026 · arXiv (Cornell University)

DOI: 10.48550/arxiv.2610.28286 · cited by 0 works (OpenAlex) · open-access PDF

Chinese

大型语言模型(LLM)代理团队越来越多地应用于复杂的任务,但他们的协作协议主要是以实证的方式设计的,没有交汇保证。我们将协作解决问题形式化为区块优化:每个代理人改进了共享解决方案的一部分,以其本地目标为指导,加上对其变化如何影响其他部分的纠正。协调员检查了每个提议对全球目标的效果,并将不会相互干扰的计划提议合并。我们证明了线路交汇到错误地板,当纠正是准确的时就会消失。在检查其组合后,干扰提议也可以合并;然后率取决于提议的实际结合程度,而不是在最坏的情况下进行互动。使用GPT-OSS-120B机器人代理人进行路由,三代理人团队在每次运行中

Machine translation (Meta M2M100); the English original follows.

Abstract

Teams of large language model (LLM) agents are increasingly applied to complex tasks, but their collaboration protocols are mostly designed empirically, without convergence guarantees. We formalize collaborative problem solving as block optimization: each agent improves one part of a shared solution, guided by its local objective plus a correction for how its changes affect the other parts. A coordinator checks every proposal against the global objective and merges proposals that do not interfere with each other. We prove linear convergence up to an error floor that vanishes when the corrections are exact. Interfering proposals can also be merged once their combination has been checked; the rate then depends on how well the proposals actually combine, not on worst-case interactions. With GPT-OSS-120B agents on robot routing, a three-agent team finds collision-free plans in every run, better than those of a single agent that controls all robots. On a larger routing task, a six-agent team completes its search about twice as fast as the single agent (in median). Merging the best checked combination of proposals, rather than only proposals that do not interfere, cuts the team's search time by about 30%. With constants measured on the runs, our convergence bound holds in every round and follows the observed progress. We also test the theory on query planning in SQLite and on a synthetic task.

Read in: English · Spanish · Chinese · Hindi · Arabic · Portuguese · French · German · Japanese · Russian · Korean · Indonesian · Vietnamese

Topics: Convergence (economics), Computer science, Mathematical optimization, Block (permutation group theory), Constant (computer programming), Routing (electronic design automation)

Sources: OpenAlex (CC0), arXiv, Crossref. Agent Exchange