arXiv:2604.06296cs.LGcs.AI2026-04

为大模型智能体设计客户端资源优化框架,降低部署成本。

AgentOpt v0.1 Technical Report: Client-Side Optimization for LLM-Based Agent

  • 提出十种搜索算法,高效筛选多阶段智能体中的最优模型组合
  • 实验显示最佳与最差组合成本相差13-32倍,优化可节省62%-76%评估开销
  • 适用于自定义工具链的开发者,尤其关注成本与延迟的智能体应用

AI智能体在现实应用中日益普及,如Manus、OpenClaw和编程代理等。现有研究主要聚焦服务端效率,提出缓存、推测执行、流量调度与负载均衡等方法以降低服务开销。然而,随着用户越来越多地通过本地工具、远程API和多种模型组合构建智能体,客户端优化问题同样重要。客户端优化需在满足特定质量、成本与延迟约束的前提下,合理分配可用资源,包括模型选择、本地工具使用及API预算。由于这些目标依赖任务与部署场景,无法由服务端单独决定。本文提出AgentOpt,首个与框架无关的Python客户端优化包。首先研究多步智能体流水线中的模型选择,给定流水线与小规模评估集,目标是找到最具成本效益的模型角色分配方案。该问题实际影响显著:在精度匹配情况下,最优与最差模型组合的成本差距可达13-32倍。为高效探索指数级增长的组合空间,AgentOpt实现十种搜索算法,包括UCB-E、低秩分解的UCB-E、臂消除、Epsilon-LUCB、阈值逐次消除和贝叶斯优化。在四个基准测试中,UCB-E在接近最优准确率的同时,相比暴力搜索减少62%-76%的评估预算。代码与基准结果见https://agentoptimizer.github.io/agentopt/

原文摘要 · Abstract (English)

AI agents are increasingly deployed in real-world applications, including systems such as Manus, OpenClaw, and coding agents. Existing research has primarily focused on server-side efficiency, proposing methods such as caching, speculative execution, traffic scheduling, and load balancing to reduce the cost of serving agentic workloads. However, as users increasingly construct agents by composing local tools, remote APIs, and diverse models, an equally important optimization problem arises on the client side. Client-side optimization asks how developers should allocate the resources available to them, including model choice, local tools, and API budget across pipeline stages, subject to application-specific quality, cost, and latency constraints. Because these objectives depend on the task and deployment setting, they cannot be determined by server-side systems alone. We introduce AgentOpt, the first framework-agnostic Python package for client-side agent optimization. We first study model selection, a high-impact optimization lever in multi-step agent pipelines. Given a pipeline and a small evaluation set, the goal is to find the most cost-effective assignment of models to pipeline roles. This problem is consequential in practice: at matched accuracy, the cost gap between the best and worst model combinations can reach 13-32x in our experiments. To efficiently explore the exponentially growing combination space, AgentOpt implements ten search algorithms, including UCB-E, UCB-E with Low-Rank Factorization, Arm Elimination, Epsilon-LUCB, Threshold Successive Elimination, and Bayesian Optimization. Across four benchmarks, UCB-E recovers near-optimal accuracy while reducing evaluation budget by 62-76\% relative to brute-force search. Code and benchmark results available at https://agentoptimizer.github.io/agentopt/.

智能体优化模型选择成本控制客户端

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