This work presents MetaRoute-Bench, an open, inspectable framework for comparing meta-decision policies under a shared execution model, and releases task generation, policies, traces, tests, and analysis artifacts to support live-system validation.
Abstract
Agentic systems must repeatedly decide whether to answer directly, decompose a task, invoke a tool, execute code, delegate to a specialist, verify an intermediate result, or recover from failure. These meta-decisions affect not only task success but also operating cost and latency, yet they are often embedded inside an orchestration framework and evaluated only through aggregate task accuracy. We present MetaRoute-Bench, an open, inspectable framework for comparing meta-decision policies under a shared execution model. The initial benchmark contains 180 synthetic task profiles spanning data analysis, research, and document processing, eight routing policies, and 30 paired random seeds. Across 43,200 traces, a task-aware compositional policy achieves 79.4% success compared with 76.7% for a strong workload-specific static policy, 67.4% for one-shot task routing, and 52.9% for direct answering. Relative to the static policy, this is a 2.7 percentage-point improvement with paired 95% CI of plus or minus 2.0 points, at 4.7% higher mean cost and 6.4% higher latency. Ablations show the largest losses when route composition is restricted to one operation and when verification is removed. These results are generated by a seeded offline execution model rather than a live deployment; accordingly, the primary contribution is a reproducible evaluation method and an analysis of routing-policy tradeoffs, not evidence of production effectiveness. We release task generation, policies, traces, tests, and analysis artifacts to support live-system validation.
This work introduces an executable benchmark and a budget-aware meta-router that composes heterogeneous operations from raw task text that establishes a reproducible testbed and a bounded proof of concept, not evidence of live-LLM performance.
Natan Vidra, Alina Kapanova, Arun Kanhai et al.· 0 citations
The results suggest that scientific-agent capability depends not only on the base model but on whether an architecture can be formed to match the task's cognitive structure, as well as establishing results on regret, planning invalidation, amortization, subtree interfaces, serializability, and verification.
HACO is proposed, 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.
Testing three production engines showed that one achieves 22/22 syntactic TPC-H acceptance but falls short on full semantic validation, function-level pass rates of 94% on non-string categories mask dramatic per- category swings.
Eluna is a graph-guided, multi-agent framework that encodes SOPs as directed acyclic graphs with progressive disclosure and delegates independent tasks to parallel sub-agents, each with persistent code execution and live data access.
Ning Liu, Kalle Kujanpää, Zhaoxuan Zhu et al.· 1 citation
Two methodology contributions are presented: a declarative-markdown harness with a small mutation surface, and an auto-research loop in which failure-mode analysis on completed experiments proposes new hypotheses, optionally human-reviewed, that progress through the same experiment workflow.
Chia-liang Kao, Kent Huang· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.