Skip to content
AI News HubLIVE
Original source2 min read

Uncertainty-Aware Resource Orchestration for Agentic AI Systems

Summary

An arXiv paper formalizes the uncertainty-aware agentic orchestration problem for LLM-driven multi-step pipelines whose compute, bandwidth, and latency demands are unknown at dispatch time. It proposes CRO, an online algorithm that uses conformal prediction over sliding execution traces to produce dispatch-time reservations with finite-sample, distribution-free coverage guarantees. Simulations show CRO is the only evaluated method that meets target probabilistic coverage at all risk levels while achieving the lowest over-reservation among coverage-feasible methods, roughly halving the resource waste of a Chebyshev-bound baseline.

SourcearXiv AIAuthor: Masoud Shokrnezhad, Tarik Taleb
Uncertainty-Aware Resource Orchestration for Agentic AI Systems
Report an error

The correction channel is not available yet. You can copy the article reference below for later.

Correction instructions
Read article

[Submitted on 14 Sep 2026]

Title:Uncertainty-Aware Resource Orchestration for Agentic AI Systems

View a PDF of the paper titled Uncertainty-Aware Resource Orchestration for Agentic AI Systems, by Masoud Shokrnezhad and 1 other authors

View PDF HTML (experimental)

Abstract:Agentic artificial intelligence (AI) systems powered by large language models (LLMs) execute as autonomous multi-step pipelines that dynamically invoke tools, integrate observations into memory, and iterate until a task is resolved or a resource budget is exhausted. Unlike classical workflows with fixed graphs, the aggregate compute, bandwidth, and end-to-end latency demands of such pipelines are unknown at dispatch time: they emerge at runtime from intermediate observations and stochastic token sampling, yielding heavy-tailed, multi-modal random variables. This unpredictability forces infrastructure orchestrators into a dilemma: under-provisioning risks mid-execution throttling and deadline violations, while over-provisioning wastes scarce edge or cloud capacity. Existing schedulers require a fully known pipeline graph, while edge resource-management methods rely on parametric or stationary demand models, and neither fits the unknown, non-stationary profiles of agentic pipelines. We formalize this setting as the uncertainty-aware agentic orchestration problem, where the goal is to reserve, at dispatch time, compute and bandwidth allocations that cover actual pipeline demands, and to verify that the pipeline can meet its deadline, each with a prescribed probability. We then propose Conformal Reservation for Orchestration (CRO), an online algorithm that translates a sliding window of past execution traces into dispatch-time resource allocations with finite-sample, distribution-free coverage guarantees via conformal prediction. Simulations over heterogeneous task mixes with multi-modal and heavy-tailed profiles show that CRO is the only evaluated method that simultaneously satisfies target probabilistic coverage across all risk levels while, among coverage-feasible methods, attaining the lowest over-reservation, roughly halving the resource waste of the Chebyshev-bound baseline.

Comments: 6 pages, 2 figures. Accepted to IEEE MECOM 2026, Marrakech, Morocco, 2-4 November 2026

Subjects:

Artificial Intelligence (cs.AI); Distributed, Parallel, and Cluster Computing (cs.DC); Machine Learning (cs.LG); Multiagent Systems (cs.MA); Networking and Internet Architecture (cs.NI)

Cite as: arXiv:2611.05392 [cs.AI]

(or arXiv:2611.05392v1 [cs.AI] for this version)

https://doi.org/10.48550/arXiv.2611.05392

arXiv-issued DOI via DataCite

Submission history

From: Masoud Shokrnezhad [view email] [v1] Mon, 14 Sep 2026 09:30:19 UTC (646 KB)

Full-text links:

Access Paper:

View a PDF of the paper titled Uncertainty-Aware Resource Orchestration for Agentic AI Systems, by Masoud Shokrnezhad and 1 other authors

View PDF

HTML (experimental)

TeX Source

view license

Additional Features

Audio Summary

Current browse context:

cs.AI

new | recent | 2026-11

Change to browse by:

cs cs.DC cs.LG cs.MA cs.NI

References & Citations

SciX

Google Scholar

Semantic Scholar

Loading...

Data provided by:

Bibliographic Tools

Bibliographic and Citation Tools

Bibliographic Explorer Toggle

Bibliographic Explorer (What is the Explorer?)

Connected Papers Toggle

Connected Papers (What is Connected Papers?)

Litmaps Toggle

Litmaps (What is Litmaps?)

scite.ai Toggle

scite Smart Citations (What are Smart Citations?)

Code, Data, Media

Code, Data and Media Associated with this Article

alphaXiv Toggle

alphaXiv (What is alphaXiv?)

Links to Code Toggle

CatalyzeX Code Finder for Papers (What is CatalyzeX?)

DagsHub Toggle

DagsHub (What is DagsHub?)

GotitPub Toggle

Gotit.pub (What is GotitPub?)

Huggingface Toggle

Hugging Face (What is Huggingface?)

ScienceCast Toggle

ScienceCast (What is ScienceCast?)

Demos

Demos

Replicate Toggle

Replicate (What is Replicate?)

Spaces Toggle

Hugging Face Spaces (What is Spaces?)

Spaces Toggle

TXYZ.AI (What is TXYZ.AI?)

Related Papers

Recommenders and Search Tools

Link to Influence Flower

Influence Flower (What are Influence Flowers?)

Core recommender toggle

CORE Recommender (What is CORE?)

Author

Venue

Institution

Topic

About arXivLabs

arXivLabs: experimental projects with community collaborators

arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.

Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.

Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.

Which authors of this paper are endorsers? | Disable MathJax (What is MathJax?)

Key points and analysis

Article intelligence

EngineersAdvanced

Key points

  • Agentic LLM pipelines have unknown, non-stationary compute, bandwidth, and latency demands that emerge at runtime as heavy-tailed, multi-modal random variables.
  • CRO converts a sliding window of past execution traces into dispatch-time compute and bandwidth reservations with finite-sample, distribution-free coverage guarantees via conformal prediction.
  • In heterogeneous task-mix simulations, CRO is the only method that satisfies target probabilistic coverage across all risk levels and has the lowest over-reservation among feasible methods, about half the resource waste of the Chebyshev-bound baseline.
  • The 6-page, 2-figure paper was accepted to IEEE MECOM 2026, held 2–4 November 2026 in Marrakech, Morocco.

Highlights and analysis are generated automatically and may contain errors. Check the original source.