模型性能趋同后,动态组合多智能体结构能显著提升任务表现。
AdaptOrch: Task-Adaptive Multi-Agent Orchestration in the Era of LLM Performance Convergence
- 根据任务依赖图和领域特征,自动选择最优多智能体协作结构。
- 在编码、推理等任务上比固定结构提升12%至23%。
- 适合追求系统级优化的AI工程师和架构设计者。
随着不同提供商的大语言模型在基准测试中性能趋于一致,单一模型选型的收益逐渐降低。我们提出,智能体协同的拓扑结构——即多个智能体如何协调、并行与合成——已成为系统性能的关键因素。本文提出 AdaptOrch 框架,支持基于任务依赖图和实证领域特征,动态选择四种典型拓扑(并行、串行、分层、混合)中的最优方案。核心贡献包括:(1) 提出性能收敛尺度律,量化了拓扑选择优于模型选型的条件;(2) 设计拓扑路由算法,在 O(|V| + |E|) 时间内将任务分解有向图映射到最优模式;(3) 构建自适应融合协议,具备可证明终止性与并行输出的一致性评分机制。在 SWE-bench(编码)、GPQA(推理)和检索增强生成任务上验证,即使使用相同底层模型,拓扑感知协作仍带来12%-23%的性能提升。结果表明,系统拓扑设计应作为独立于模型规模的首要优化目标。
原文摘要 · Abstract (English)
As large language models from diverse providers converge toward comparable benchmark performance, the traditional paradigm of selecting a single best model per task yields diminishing returns. We argue that orchestration topology -- the structural composition of how multiple agents are coordinated, parallelized, and synthesized -- now dominates system-level performance over individual model capability. We present AdaptOrch, a formal framework for task-adaptive multi-agent orchestration that dynamically selects among four canonical topologies (parallel, sequential, hierarchical, and hybrid) based on task dependency graphs and empirically derived domain characteristics. Our framework introduces three key contributions: (1) a Performance Convergence Scaling Law, formalizing conditions under which orchestration selection outweighs model selection; (2) a Topology Routing Algorithm that maps task decomposition DAGs to optimal orchestration patterns in O(|V| + |E|) time; and (3) an Adaptive Synthesis Protocol with provable termination guarantees and heuristic consistency scoring for parallel agent outputs. We validate AdaptOrch across coding (SWE-bench), reasoning (GPQA), and retrieval-augmented generation tasks, demonstrating that topology-aware orchestration achieves 12-23% improvement over static single-topology baselines, even when using identical underlying models. Our results establish orchestration design as a first-class optimization target independent of model scaling.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。