论文研究 arXiv cs.AI Mon, 19 Oct 2026 正文 ok 270 words

FRACTAL:具有形式化通信、收敛性与深度界限的自相似多 Agent 编排架构

英文标题:FRACTAL: A Self-Similar Multi-Agent Orchestration Architecture with Formal Communication, Convergence, and Depth Bounds

研究人员提出了名为 FRACTAL 的自相似多 Agent 架构,用于复杂任务目标的递归分解。该架构在分解树的每一层均递归复用由编排器、集成体、知识账本、决策器与元观察者构成的五组件结构。论文形式化证明了该架构能将节点内通信开销从自由辩论的二次方降至 O(kr) 线性复杂度,并给出了基于多样性阈值的两阶段准则、收敛性深度界限以及贝叶斯跨层级上报机制。该工作为设计结构规范、计算成本可控且具备数学收敛保障的层次化 Agent 编排系统提供了理论范式。
打开原文相关 2.4 · 机会 1
media2.1 KB media640 B media612 B media380 B media9.1 KB media32.7 KB media22.8 KB media24.2 KB media34.7 KB

中文

[于 2026 年 10 月 15 日提交]

标题:FRACTAL: A Self-Similar Multi-Agent Orchestration Architecture with Formal Communication, Convergence, and Depth Bounds(FRACTAL:具有形式化通信、收敛性与深度界限的自相似多 Agent 编排架构)

查看由 Ohad Dan 及另外 1 位作者撰写的论文 PDF:《FRACTAL: A Self-Similar Multi-Agent Orchestration Architecture with Formal Communication, Convergence, and Depth Bounds》

查看 PDF HTML (实验性)

摘要:我们提出了 FRACTAL,这是一种用于递归目标分解的自相似多 Agent 架构。在该架构中,由编排器(Orchestrator)、集成体(Ensemble)、知识账本(Knowledge Ledger)、决策器(Decision Maker)和元观察者(Meta-Observer)构成的相同五组件组织模式,在分解树的每一层中递归复现。我们提出了四项形式化贡献:(1) 通信界限:证明在双阶段盲提议/压力测试协议下,节点内通信成本与集成体规模和轮次呈线性关系($O(kr)$),而自由形式辩论的成本为二次方关系,并给出了评估者数量固定的明确假设;(2) 双模式编排准则:通过可测量的多样性饱和阈值,将生成阶段与评估阶段解耦;(3) 绝对多数收敛保证:在特定的一致性水平下提供明确的概率界限,并在可操作的目标复杂度度量下给出形式化深度界限;(4) 贝叶斯跨层级上报机制:在单个后验更新下统一迟滞响应与契约违约信号。我们通过推导演示与多层案例研究定性展示了架构的执行过程;本文未提出定量性能主张,并明确讨论了该模型的形式化与归纳偏置局限性,包括一个尚未实现但架构兼容的有界自我改进方向。我们使用“分形”(Fractal)作为自相似性的架构隐喻,而非已测量的数学性质。架构对比性能的实证验证将留待未来工作完成。

提交历史

来自:Ohad Dan [

查看电子邮件

]

[v1]

2026 年 10 月 15 日 星期四 19:02:50 UTC (554 KB)

English / 原文

[Submitted on 15 Oct 2026]

Title:FRACTAL: A Self-Similar Multi-Agent Orchestration Architecture with Formal Communication, Convergence, and Depth Bounds

View a PDF of the paper titled FRACTAL: A Self-Similar Multi-Agent Orchestration Architecture with Formal Communication, Convergence, and Depth Bounds, by Ohad Dan and 1 other authors

View PDF HTML (experimental)

Abstract:We present FRACTAL, a self-similar multi-agent architecture for recursive goal decomposition, in which the same five-component organizational pattern -- Orchestrator, Ensemble, Knowledge Ledger, Decision Maker, Meta-Observer -- recurs at every level of a decomposition tree. We make four formal contributions: (1) a communication bound showing intra-node cost is linear in ensemble size and round count (O(kr)) under a two-phase blind-proposal/stress-test protocol, versus quadratic cost for free-form debate, with an explicit, stated assumption on fixed evaluator count; (2) a two-mode orchestration criterion separating generative and evaluative phases via a measurable diversity-saturation threshold; (3) a supermajority convergence guarantee with explicit probability bounds at stated agreement levels, and a formal depth bound under an operationalized goal-complexity measure; (4) a Bayesian inter-layer escalation mechanism unifying hysteresis and contract-breach signaling under one posterior update. We illustrate the architecture's execution qualitatively on a worked example and a multi-layer case study; we do not report quantitative performance claims in this paper, and we explicitly discuss the formal and inductive-bias limitations of the model, including an unimplemented but architecture-compatible direction toward bounded self-improvement. We use "fractal" as an architectural metaphor for self-similarity, not a measured mathematical property. Empirical validation of the architecture's comparative performance is left to future work.

Submission history

From: Ohad Dan [

view email

]

[v1]

Thu, 15 Oct 2026 19:02:50 UTC (554 KB)