跳到正文
Jones Ray

ScholarPulse 日报 2026-07-11

2026-07-11 学术简报:2 篇。ANet Patu-1协议通过自组织协作使异质AI代理网络的集体价值随规模增长并超越同质强模型网络,揭示协作缩放律而非规模缩放。

今日速览

序号标题来源日期主题推荐等级
1ANet Patu-1: The Value of Connection in the Agent NetworkarXiv2026-07-16AI-Agent高
2OmniaBench: Benchmarking General AI Agents Across Diverse ScenariosarXiv2026-07-16AI-Agent高

重点论文与技术动态

1. ANet Patu-1: The Value of Connection in the Agent Network

一句话结论

ANet Patu-1协议通过自组织协作使异质AI代理网络的集体价值随规模增长并超越同质强模型网络,揭示协作缩放律而非规模缩放。

核心内容

方法与数据

价值判断

(字数:298)

摘要 The Internet taught us that the value of a network depends on \emph{how} its nodes connect: broadcast stars scale as $V\!\propto\!N$ (Sarnoff), fully-connected meshes as $N^2$ (Metcalfe), and group-forming networks as $2^{N}$ (Reed). We ask the analogous question for networks of AI agents. We model the net value of connection as a function of coordination-group size, derive from it the properties an optimal collaboration protocol must have, and introduce ANet Patu-1 -- a self-organizing consensus protocol in which the network continuously re-forms its own coalitions, adaptively riding the upper envelope of all three regimes at $O(1)$ parallel consensus rounds. To measure value without opinion-grading, we score an emergent protocol by formally specifying it and deriving its complexity, the way distributed algorithms are analyzed. Two results follow. (i)~Emergence -- a crowd of the \emph{cheapest} model, when heterogeneous, starts weak but its collective value compounds with $N$ and \emph{overtakes} a crowd of a far \emph{stronger} model that is homogeneous: a crossover that marks a scaling law for collaboration rather than for scale. (ii)~Reflexivity -- a heterogeneous network, given only its own problem and no design hints, converges on ANet Patu-1 itself, reconstructing the high-dimensional law that governs its own connective value.

2. OmniaBench: Benchmarking General AI Agents Across Diverse Scenarios

一句话结论

OmniaBench为通用AI代理在多样化场景中的能力评估提供了全面基准。

一段话。
该基准通过构建覆盖ToC、ToB、ToE的层次化场景分类,合成1431个任务并引入十维能力评估体系,显著挑战当前前沿模型,揭示其在规划、约束维护等关键能力的持续缺陷。

核心内容

方法与数据

价值判断

摘要 Large language models are increasingly evolving from text generators into general agents capable of understanding user requests, invoking external tools, and completing complex tasks through interaction. However, existing agent benchmarks often focus on limited scenarios, tool ecosystems, or interaction formats, making it difficult to systematically characterize model capabilities across heterogeneous application settings. We introduce OmniaBench, a benchmark for evaluating general agents across diverse scenarios with explicit state spaces. We derive application-oriented scenario knowledge from app stores, product documents, industry resources, Web retrieval, and human refinement, forming a hierarchical taxonomy that spans ToC, ToB and ToE with 90 level-1 and 354 level-2 domains. Based on this taxonomy, we construct executable environments and synthesize single-turn and multi-turn tasks through four complementary routes: DAG, DAG-S, Solver, and Program. OmniaBench further introduces a ten-dimensional capability taxonomy and eight compositional atomic difficulty factors to support fine-grained evaluation and analysis. The resulting dataset contains 1,431 tasks, together with a challenging subset of 644 tasks designed to reduce evaluation cost and mitigate potential contamination of the full set after public release. The bench presents substantial challenges to current frontier models, with even Claude-Sonnet-5 and GPT-5.6-Sol achieving Overall Pass@1 scores of only 58.54 and 57.14, respectively. Further analyses reveal clear differences across domains and capabilities, as well as persistent limitations in planning, constraint maintenance, and adaptive correction. OmniaBench provides a broad and diagnostic benchmark for characterizing the capability boundaries of general agents.