arXiv:2605.22566cs.LG2026-05中稿 · ICML

用图结构动态生成任务流程,让大模型代理更高效地执行复杂任务。

GraphFlow: A Graph-Based Workflow Management for Efficient LLM-Agent Serving

论文配图:GraphFlow: A Graph-Based Workflow Management for Efficient LLM-Agent Serving
图 1 · 摘自论文原文
  • 用统一图结构表示任务流程,节点为原子操作
  • 相比现有方法平均提升4.95分,内存减少约4倍
  • 适合需要灵活调度的智能代理系统开发者

基于大语言模型(LLM)的智能体在结构化指令引导下展现出强大的推理与执行能力,这类指导通常称为工作流。然而,现有工作流辅助的智能体服务系统多依赖预定义模板和浅层匹配机制,难以捕捉深层语义关系,也难以泛化到未见过的任务。为此,我们提出一种新的工作流管理范式,将工作流以统一图结构(wGraph)表示,其中每个节点对应一个原子操作。wGraph作为共享基础,支持按需动态实例化特定任务工作流。在此基础上,我们设计GraphFlow系统,通过两项关键技术实现高效集成:第一,自适应工作流生成,根据任务语义和约束从wGraph动态构建工作流;第二,工作流状态管理,利用wGraph结构高效管理键值(KV)缓存,减少代理服务过程中的重复计算。在五个基准数据集上的大量实验表明,GraphFlow持续优于当前最先进方法,平均性能提升约4.95个百分点,同时内存占用降低约4倍。

原文摘要 · Abstract (English)

Large Language Model (LLM)-based agents demonstrate strong reasoning and execution capabilities on complex tasks when guided by structured instructions, commonly referred to as workflows. However, existing workflow-assisted agent serving systems typically rely on predefined templates and shallow matching mechanisms, which limit their ability to capture deep semantic relationships and generalize to previously unseen tasks. To address these limitations, we propose a new workflow management paradigm that represents workflows using a unified graph, termed wGraph, where each node corresponds to an atomic operation. wGraph serves as a shared substrate from which task-specific workflows are dynamically instantiated. Building on wGraph primitives, we introduce GraphFlow, a system that efficiently integrates workflows into agent serving through two key designs. First, adaptive workflow generation dynamically constructs workflows from wGraph based on task semantics and constraint requirements. Second, workflow state management exploits wGraph structure to efficiently manage Key-Value (KV) caches, reducing redundant computation during agent serving. Extensive experiments across five benchmark datasets show that GraphFlow consistently outperforms state-of-the-art methods, yielding an average performance improvement of approximately 4.95 percentage points, while achieving an approximately 4$\times$ reduction in memory footprint.

智能体工作流图神经网络高效推理

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