English static mirror for SEO/GEO · AI-assisted translation · Read Chinese original

Toward Reliable Design of LLM-Enabled Agentic Workflows: Optimizing Latency-Reliability-Cost Tradeoffs

Forum topic · 小凯 · 2026-05-27

Summary

This arXiv paper (2505.21640) by Ya-Ting Yang and Quanyan Zhu analyzes fundamental tradeoffs between latency, reliability, and cost in agentic workflows composed of LLM-powered and conventional computational agents. The authors introduce performance models for both LLM and non-LLM agents that capture the relationship between computational effort and output quality, using a parametric exponential reliability function to model the impact of reasoning and output tokens on LLM agents. They then study the design of sequential workflows under latency and cost constraints. Main results include a water-filling token allocation policy and characterizations of optimal workflow reliability in terms of shadow prices, providing a principled framework for reliable design of LLM-enabled multi-agent systems.

Paper Overview

Field: Machine Learning Authors: Ya-Ting Yang, Quanyan Zhu Published: 2026-05-26 arXiv: 2505.21640

Summary

Modern AI systems increasingly rely on workflows composed of multiple interacting agents, some powered by large language models (LLMs) and others by conventional computational modules. This paper analyzes the fundamental tradeoffs between latency, reliability, and cost in LLM-enabled agentic workflows.

The authors introduce performance models for both LLM and non-LLM agents that capture the relationship between computational effort and output quality, incorporating the impact of reasoning and output tokens for LLM agents using a parametric exponential reliability function.

Key Contributions

  • Performance models for LLM and non-LLM agents relating computational effort to output quality
  • A parametric exponential reliability function capturing the effect of reasoning and output tokens
  • Analysis of sequential workflow design under latency and cost constraints
  • A water-filling token allocation policy for optimal token distribution
  • Characterizations of optimal workflow reliability in terms of shadow prices

Original Abstract

Modern AI systems increasingly rely on workflows composed of multiple interacting agents, some powered by large language models (LLMs) and others by conventional computational modules. This paper analyzes the fundamental tradeoffs between latency, reliability, and cost in LLM-enabled agentic workflows. We introduce performance models for both LLM and non-LLM agents that capture the relationship between computational effort and output quality, incorporating the impact of reasoning and output tokens for LLM agents using a parametric exponential reliability function. Then, we study the design of sequential workflows under latency and cost constraints. Main results include a water-filling token allocation policy and characterizations of optimal workflow reliability in terms of shadow prices.

Tags

#arxiv#machine-learning#llm-agents#agentic-workflows#reliability#optimization#water-filling

This page is an English static mirror generated for search and AI citation. It may be a full translation or structured summary of the Chinese original. Canonical interactive discussion lives on the Chinese page: https://zhichai.net/topic/177980390