构建可复用的智能工作流库,按需选择最优解法。
FlowBank: Query-Adaptive Agentic Workflows Optimization through Precompute-and-Reuse

- 通过分阶段生成、筛选和匹配,构建互补的工作流组合库。
- 在五个基准上平均得分最高,比最强基线提升14.92%。
- 适合需要高效推理且任务多样的复杂智能体系统使用。
基于大语言模型的多智能体系统日益强大,但现有工作流优化范式存在明显权衡:任务级方法耗时大量离线计算,仅部署单一工作流,导致其他候选方案闲置;查询级方法则为每个查询动态生成新工作流,推理开销巨大。我们分析发现,两类方法更互补而非竞争:离线搜索得到的工作流常覆盖不同查询子集,许多本需高成本生成的查询其实已有低成本预计算工作流可解。因此提出新目标:不追求单一最优工作流或逐次重生成,而是构建一个紧凑、可复用、互补的工作流库,并在推理时按需自适应选择。实现该目标需解决三个耦合问题:生成互补而非冗余的候选工作流、压缩成小规模可部署组合、在性能与成本间权衡为每个查询匹配最优工作流。为此提出FlowBank,一种三阶段框架:Diversifying阶段采用DiverseFlow引导搜索,覆盖未充分服务的查询,生成高覆盖率候选池;Curating阶段采用CuraFlow将候选池压缩为低冗余紧凑组合;Matching阶段将部署建模为查询-工作流二分图上的边缘价值预测,为每个输入查询路由至预测效用最高的组合成员。在五个基准上,FlowBank平均得分最高,同时保持成本竞争力,相比最强自动化与人工基线分别提升4.26%和14.92%。
原文摘要 · Abstract (English)
Large Language Model (LLM)-based multi-agent systems are increasingly powerful, but current agentic workflow optimization paradigms make an unsatisfying trade-off. Task-level methods spend substantial offline compute yet deploy only a single workflow, leaving complementary candidates unused, while query-level methods synthesize a new workflow per query at substantial inference cost. Our motivating analysis shows these paradigms are more complementary than competing: workflows discovered during offline search often solve different subsets of queries, and many queries handled by expensive query-level generation can already be solved by cheaper precomputed workflows. This suggests a different objective: rather than searching for one universally best workflow or regenerating one per instance, we should build a compact bank of reusable, complementary workflows and select among them adaptively at inference time. Doing so requires solving three coupled problems: generating complementary rather than redundant candidates, compressing them into a small deployable portfolio, and assigning each query to the right workflow under a performance-cost trade-off. To this end, we present FlowBank, a three-stage framework for portfolio-based agentic workflow optimization. Diversifying proposes DiverseFlow to steer search toward under-covered queries and produce a high-coverage candidate pool. Curating proposes CuraFlow to compress this pool into a compact portfolio with minimal redundancy. Matching casts deployment as edge-value prediction on a query-workflow bipartite graph and routes each incoming query to the portfolio member with the best predicted utility. Across five benchmarks, FlowBank achieves the highest average score among the evaluated methods while remaining cost-competitive, improving over the strongest automated and handcrafted baselines by 4.26% and 14.92% relative, respectively.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。