接入 API · 个人 AI 解读连接自己的模型解读资讯,浏览新闻无需配置。
返回资讯列表
前沿研究社区 / 第三方国际

Scaling Discovery through Test-Time Communication

arXiv 人工智能论文 · 发布
今日摘要使用自己的 API,仅供个人查看

来源摘要

arXiv:2609.21032v1 Announce Type: cross Abstract: Science advances not in isolation but through collaboration, yet existing agentic systems capture little of this. Whether communicating agents help remains an open question with mixed prior results. We show that test-time communication can substantially outperform independent parallel attempts on challenging tasks, where sharing a breakthrough can push the whole group forward. We first study the effect of scaling multi-agent test-time communication, where agents have no predefined roles and communicate via a shared directory, on ARC-AGI-3, a benchmark requiring novel problem solving. We find that a team of $k$ communicating agents, team@$k$, matches the success rate of $4k$ independent agents, and this advantage grows with $k$, suggesting gains compound with scale. The effect is not merely efficiency: a task that no single agent can solve, a team of agents can solve reliably. Furthermore, these gains transfer to research-oriented tasks, given sufficient compute. On polyomino packing, communicating agents outperform best@$k$ and exceed the prior best-known score. On MNIST classifier compression, communication surpasses the best-known human solution. A team of four agents produced a 1,957-byte classifier submission achieving 99.4% test accuracy, smaller than both the best-known human solution and the best single-agent result. These gains are not unconditional. Independent agents may outperform communication when compute is limited or when a clear measure of progress is absent. However, under sufficient compute and clear feedback, multi-agent communication consistently yields stronger results.

阅读原始来源
来源
arXiv 人工智能论文 · 社区 / 第三方
来源发布
2026/09/21 12:00
首次采集
2026/09/21 17:59

本文为公开信息索引与摘要,详情及后续变化请以原始来源为准。

把 AI 雷达放到桌面

在支持安装的浏览器中,可以将本站作为应用打开。

安装入口取决于浏览器;应用和网站使用同一份最新内容。

查看完整安装指南