提出可组合的元路由机制,让智能体自动规划多步操作流程。
Learning Compositional Meta-Routing for Agentic Workflows: An Executable Benchmark
- 基于词字符特征建模,动态组合推理、检索、执行等操作
- 在测试集上成功率100%,成本比静态策略低43%
- 适合研究智能体工作流规划与跨任务泛化能力的开发者
智能体不仅需生成答案,还需决定前置推理与执行操作。现有路由方法多孤立选择模型端点、检索深度或工具。本文引入可执行基准与预算感知元路由器,从原始任务文本中组合异构操作。基准包含216个训练、72个开发、108个保留测试及108个锁定词汇偏移挑战任务,覆盖数据处理、冻结语料研究与文档处理。操作结果经机器验证。独立正则化逻辑回归头从词与字符特征预测操作概率,于开发集温度缩放后,在路由成本与动作数预算下贪婪组合。在保留测试集上,学习策略成功率100%,显著优于强静态策略的93.5%,成本降低43%;匹配的一次性路由仅达56.5%。在未触碰的挑战集上,学习策略下降至75.9%,仍低于静态路由的93.5%,但成本低49%,优于一次性路由34.3个百分点。差距揭示词汇泛化为首要瓶颈,而非路由执行。结果建立可复现测试平台与有限证明概念,非真实大模型性能证据。
原文摘要 · Abstract (English)
Agentic systems must decide not only what answer to produce, but which reasoning and execution operations should precede it. A controller may answer directly, decompose a request, retrieve evidence, execute code, delegate to a specialist, or verify an intermediate result. Existing routing work largely selects model endpoints, retrieval depth, or tools in isolation. We introduce an executable benchmark and a budget-aware meta-router that composes heterogeneous operations from raw task text. The benchmark contains 216 training, 72 development, 108 held-out test, and 108 locked lexical-shift challenge tasks across data analysis, frozen-corpus research, and document processing. Outcomes are machine checked after operations execute. Independent regularized logistic heads predict operation probabilities from word and character features, are temperature-scaled on development data, and are greedily composed under route-cost and action-count budgets. On the held-out test, the learned policy achieves 100% success versus 93.5% for strong static and fixed workflows, with 43% lower cost than the static policy; a matched learned one-shot router reaches 56.5%. On the untouched challenge split, learned success falls to 75.9% and trails static routing at 93.5%, while remaining 49% cheaper and exceeding one-shot routing by 34.3 points. The gap identifies lexical generalization, rather than route execution, as the principal limitation. These results establish a reproducible testbed and a bounded proof of concept, not evidence of live-LLM performance.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。