The Efficiency-Adjusted Success Rate (EASR) is reported - success weighted by resource consumption relative to declared budgets - revealing that high accuracy at unbounded cost is not production-viable.
Abstract
We present AgentSLABench, a resource-aware evaluation framework for autonomous AI agents that measures correctness alongside latency, cost, compute, memory, and network usage under declared resource budgets. Unlike standard benchmarks that report only accuracy, AgentSLABench produces a multi-dimensional profile per agent per task - the same way systems profilers (perf, pprof, cProfile) measure resource consumption of code, but extended with task correctness as a first-class dimension. AgentSLABench provides 16 task environments across 6 categories (5 core: multi-hop QA, retail substitution, code generation, web shopping, travel planning; 11 extended) with isolated Docker containers, declared CPU/memory/time/network budgets, sealed test sets with SHA256 hashes, and a standardized profiling protocol. We profile 5 general-purpose baseline agents (ReAct, PlanAndSolve, Reflexion, CoT, Random) plus 4 task-specialized agents, finding that specialized agents achieve 100% success on 3/5 core tasks (fact_qa, web_shopping, travel_planning) and 66.7-83.3% on retail and code_gen, while general baselines fail entirely on 4/5 domain tasks. Crucially, we report the Efficiency-Adjusted Success Rate (EASR) - success weighted by resource consumption relative to declared budgets - revealing that high accuracy at unbounded cost is not production-viable. We release the full infrastructure, sealed test sets, and profiling results to enable reproducible, resource-aware agent evaluation.
Coding-agent benchmarks have largely measured whether agents can produce functionally correct patches, but production software also demands measurable speedups on real execution targets. Performance optimization is a distinct agentic task: agents must profile executions, diagnose cross-layer bottlenecks, edit code without breaking correctness, and verify that gains are reproducible rather than measurement artifacts. We introduce PERFOPT-Bench, a benchmark for evaluating this full performance-engineering loop. Each task provides a correct but deliberately suboptimal codebase and asks the agent to improve a target performance metric; scoring requires hidden correctness tests, verified-speedup measurement, and trajectory-level audit. We evaluate 7 agent stacks with different LLMs and agent frameworks on 7 long-horizon optimization tasks. The results show that optimization performance is workload-dependent rather than determined by model identity alone: no single stack dominates, and changing the agent framework can materially change the same LLM's per-task speedup profile. We further find that raw speedup is unsafe as a benchmark score, since some large gains arise from benchmark-specific shortcut exploitation; an exploratory relay pilot suggests that restarting from an externalized optimization summary can recover additional headroom after an initial session stops. The benchmark and our evaluation are available at: https://anonymous.4open.science/r/Dataset-D3CC.
YI-YING Cui, Yi Xie, Piaohong Wang et al.· 0 citations
As large language model (LLM) agents move from isolated prompting to longhorizon workflows, failures increasingly arise at the role-to-instance binding boundary, where task-specific role requests must be assigned to concrete agent instances under current service, network, and query conditions. Existing agent system research has improved role specialization, workflow topology, memory, and tool use, but often assumes a fixed stable execution environment. This assumption limits deployed reliability, because the same role request can exhibit different latency, failure probability, and output quality across agent instances operating under different service regions and network conditions. We propose Hedged Agent Computing (HACO), a runtime control scheme that treats each role request as a reliability-constrained selection problem over candidate agent instances, each coupling a role type, an LLM, and a concrete execution environment. Different from routing, HACO adaptively selects a hedge set of candidates for each invocation. Its allocation rule combines optimistic ranking, which prioritizes candidates with high estimated quality, reliability, and informative uncertainty, with conservative reliability accumulation, which stops selection only after the hedge set reaches a target success probability. Through experience harvesting, HACO updates candidate and link profiles from all executed candidate traces, including quality, success, latency, and network statistics. Experiments on various benchmarks, together with runtime degradation studies, show that HACO improves robustness and output quality under changing deployment conditions, while using lower token and latency cost than exhaustive parallel execution.
Autonomous agents are increasingly adopted to complete complex, multi-tool workflows in real-world settings. However, existing benchmarks typically separate tasks by application or capability and evaluate agents in environments that are cleaner and more stable than those encountered in practice. We introduce DuMateBench, a real-session benchmark reconstructed from anonymized and privacy-screened user sessions collected from a large-scale production agent platform. Each task preserves the relevant pre-solution interaction history, persistent configurations, and workspace state, and is then validated through human verification. The resulting benchmark comprises 200 tasks spanning 8 broad scenarios and 17 fine-grained capability categories, with most tasks requiring multiple capability coordination. We execute these tasks in isolated Docker containers injected with three forms of real-world environmental complexity: Insufficient, Unstable, and Noisy, and assess performance using a hybrid deterministic and LLM-as-Judge evaluation protocol. Experiments across five representative autonomous-agent frameworks paired with four state-of-the-art LLMs reveal substantial gaps in strict task completion. Complementary robustness, efficiency, and diagnostic analyses further show that performance under environmental perturbations is jointly shaped by the capabilities of the LLM and the surrounding agent framework. The code and data are publicly available at https://dumatebench.com/.
Zechun Niu, Yukun Zhao, Jia-Xin Zhang et al.· 0 citations
Multi-agent systems powered by large language models (LLMs) have demonstrated potential for collaborative problem-solving, yet increasing the number of agents often introduces redundant reasoning and communication overhead, sometimes degrading performance. We propose AgentDropout, a dynamic strategy inspired by dropout regularization in neural networks, which selectively deactivates low-contribution agents during multi-agent collaboration. At each round of discussion, AgentDropout computes a semantic novelty score for every agent by measuring the divergence of its output relative to the current group consensus. Agents whose novelty score falls below an adaptive threshold are temporarily deactivated, reducing token consumption without sacrificing viewpoint diversity. We evaluate AgentDropout on mathematical reasoning (GSM8K), commonsense reasoning (StrategyQA), and collaborative code generation (HumanEval) tasks. Across three independent runs, AgentDropout achieves accuracy comparable to or modestly above fixed 5-agent debate while reducing total token consumption by 38.0–43.5% and debate rounds by 20.5% on average. Pareto analysis reveals a promising efficiency–quality trade-off, suggesting that dynamic agent deactivation may be useful for deploying multi-agent LLM systems under computational budget constraints.
Zhengxi Xiao, Qi Guo, Yuyue Wang et al.· 2026 8th International Confe...· 1 citation
LLM-based autonomous agents fail in ways that existing observability infrastructure cannot detect. OpenTelemetry’s GenAI semantic conventions cover LLM invocation and tool execution but leave five critical agent orchestration phases—planning, reasoning, safety monitoring, inter-agent delegation, and memory management—without span-level representation. We present AgentTelemetry, an open-source benchmark suite and toolkit for evaluating fault detection in agent systems. The benchmark defines (1) a taxonomy of 14 fault types mapped to 9 agent-specific span kinds, (2) a controlled evaluation harness of 490 fault-detection cells (14 faults × 5 observability conditions × 7 frameworks; enumerated as 2,940 raw configurations across 6 mock-LLM seeds), and (3) a pip-installable library (3,700+ LOC, 78 tests) with adapters for seven frameworks. On the controlled benchmark, the full span taxonomy achieves a Fault Detection Rate (FDR) of 1.000—an upper bound confirming structural completeness—compared to 0.429 for vanilla OpenTelemetry and OTel+GenAI. An ablation study proves all nine span kinds are necessary: removing any one makes at least one fault type undetectable. A case study on 112 SWE-bench Lite instances reveals that 84/112 agent runs (75%) exhausted the 8-iteration limit and are classified as reasoning loops by structural pattern (a definitional partition of the failed-trace population, not a sampling estimate)—a failure mode invisible to vanilla OTel—and a telemetry-guided intervention improves the patch rate by +12.5 pp over a matched control (Fisher’s exact p=0.53, two-sided; demonstrative not statistically significant at n=24). All code, data, and benchmark configurations are open-source for reproducibility.
Enterprises increasingly distribute computing workloads across multiple public and private cloud providers to reduce cost, avoid vendor lock-in, and improve resilience, but this multiplies the complexity of deciding, for every incoming task, which provider to use. Static or single-objective heuristics — always choosing the cheapest or always the fastest provider — routinely fail because cost, latency, and reliability trade off against one another in ways that shift with demand and provider conditions. This paper proposes and evaluates an explainable agentic AI framework for multi-cloud task allocation built on a contextual-bandit agent (LinUCB) that observes each provider's current price, estimated latency, and load before autonomously selecting a placement, then updates its policy online from the resulting cost, latency, and service-level-agreement (SLA) outcome. Because no public multi-cloud trace exposes simultaneous, ground-truth price/latency/capacity data across providers, the framework is evaluated on a controlled, fully documented discrete-time simulation of four heterogeneous providers under realistic load dynamics — a standard and disclosed methodology in this research area. Across 30 independent simulation runs of 3,000 tasks each, the agent achieved a statistically significant improvement over the strongest single fixedweight heuristic baseline (Static-Weighted) on every safety- and balance-related metric: 86.2% fewer SLA violations, 20.9% lower average latency, and 19.6% higher load-balancing fairness (Jain's index = 0.955 vs. 0.799, paired t-test, all p < 0.001), at a 20.6% higher cost. Under a simulated transient provider degradation (a 5× latency spike on one provider for 20% of a run), the agent held SLA violations to 0.4%, versus 9.9% for naive round-robin routing and 40.2% for cost-only routing, while remaining markedly cheaper than a purely latencyreactive baseline. To support the "explainable" requirement of agentic systems intended for production use, the framework exposes two complementary explanation layers: the bandit's own per-provider linear coefficients, and a surrogate Random Forest trained to imitate the agent's decisions (99.6% fidelity), whose permutation importance identifies observed latency and price as the dominant drivers of every allocation decision. These results indicate that a lightweight, interpretable contextual-bandit agent can deliver a favourable, auditable balance of cost, latency, SLA compliance, and fairness in multi-cloud environments, including under operational stress, without the opacity of deeper reinforcement learning or black-box agentic architectures.
Dr. Sajitha A V· International Journal of Int...· 0 citations
