Dyserve: Dynamic Strategy Generation for Agent Serving
Jiayi Qian ⋅ Zishen Wan ⋅ Hanchen Yang ⋅ Souvik Kundu ⋅ Tushar Krishna
Abstract
Agentic workflows orchestrate optional operators (verifiers, routers, retries, escalations) but commit to a fixed pipeline per task type. This is structurally suboptimal: different requests, models, and runtime conditions favor different operator subsets. Additionally, no single hand-written workflow is uniformly Pareto-optimal. We present \textbf{Dyserve}, a framework that generates the serving strategy as a \textit{structured subgraph} over a workflow abstraction by solving an integer linear program (ILP). The ILP jointly selects per-node execution options (model, verification, speculative execution, retry) weighted by offline-profiled coefficients for service quality and latency performance. On LiveCodeBench, the generated strategies match the best-verify accuracy with $\sim\!10\times$ latency reduction. Additionally, we describe an event-driven suffix-repair extension that resolves a smaller ILP over the residual workflow when high-impact runtime events fire.
Chat is not available.
Successful Page Load