arXiv:2510.16499cs.CLcs.AI2025-10NeurIPS被引 7

用背包问题优化智能体组件选择,提升系统成功率并降低成本。

Automated Composition of Agents: A Knapsack Approach for Agentic Component Selection

  • 将智能体组合建模为动态背包问题,综合考量性能、预算与兼容性。
  • 在5个数据集上成功率最高提升31.6%,多智能体场景成功率达87%。
  • 适合需要高效复用组件的复杂智能体系统设计者使用。

构建高效智能体系统需在动态不确定环境中无缝集成智能体、工具与模型。现有方法多依赖静态语义检索,但因能力描述不全及检索局限,组件选择难以兼顾能力、成本与实时效用。为此,本文提出受背包问题启发的自动化框架,使编排智能体能系统性识别、选择并组装最优组件集合,综合考虑性能、预算约束与兼容性。通过实时测试候选组件并建模其效用,该方法显著简化智能体系统搭建,促进资源可扩展复用。在Claude 3.5 Sonnet上的实证评估显示,基于在线背包的编排器在五个基准数据集上始终位于帕累托前沿,相比基线实现更高成功率且组件成本显著降低。单智能体设置下,成功率最高提升31.6%;多智能体系统中,从100+智能体库中选型时,成功率由37%提升至87%。显著性能差距验证了该方法在多样领域与预算约束下的强适应性。

原文摘要 · Abstract (English)

Designing effective agentic systems requires the seamless composition and integration of agents, tools, and models within dynamic and uncertain environments. Most existing methods rely on static, semantic retrieval approaches for tool or agent discovery. However, effective reuse and composition of existing components remain challenging due to incomplete capability descriptions and the limitations of retrieval methods. Component selection suffers because the decisions are not based on capability, cost, and real-time utility. To address these challenges, we introduce a structured, automated framework for agentic system composition that is inspired by the knapsack problem. Our framework enables a composer agent to systematically identify, select, and assemble an optimal set of agentic components by jointly considering performance, budget constraints, and compatibility. By dynamically testing candidate components and modeling their utility in real-time, our approach streamlines the assembly of agentic systems and facilitates scalable reuse of resources. Empirical evaluation with Claude 3.5 Sonnet across five benchmarking datasets shows that our online-knapsack-based composer consistently lies on the Pareto frontier, achieving higher success rates at significantly lower component costs compared to our baselines. In the single-agent setup, the online knapsack composer shows a success rate improvement of up to 31.6% in comparison to the retrieval baselines. In multi-agent systems, the online knapsack composer increases success rate from 37% to 87% when agents are selected from an agent inventory of 100+ agents. The substantial performance gap confirms the robust adaptability of our method across diverse domains and budget constraints.

智能体系统组件选择优化算法自动化编排

Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。