Robust and Efficient Tool Orchestration via Layered Execution Structures with Reflective Correction
Authors: Tao Zhe, Haoyu Wang, Bo Luo, Min Wu, Wei Fan, Xiao Luo, Zijun Yao, Haifeng Chen, Dongjie Wang
Organizations: Department of Electrical Engineering and Computer Science, University of Kansas, Lawrence, KS, USA · NEC Laboratories America, Princeton, NJ, USA · Institute for Infocomm Research, A*STAR, Singapore · School of Computer Science, University of Auckland, Auckland, New Zealand · Department of Statistics, University of Wisconsin–Madison, Madison, WI, USA
Tool invocation is a core capability of agentic systems, yet failures often arise not from individual tool calls but from how multiple tools are organized and executed together. Existing approaches tightly couple tool execution with stepwise language reasoning or explicit planning, leading to brittle behavior and high execution overhead. To overcome these limitations, we revisit tool invocation from the perspective of tool orchestration. Our key insight is that effective orchestration does not require precise dependency graphs or fine-grained planning. Instead, a coarse-grained layer structure suffices to provide global guidance, while execution-time errors can be corrected locally. Specifically, we model tool orchestration as learning a layered execution structure that captures high-level tool dependencies, inducing layer-wise execution through context constraints. To handle execution-time failures, we introduce a schema-aware reflective correction mechanism that detects and repairs errors locally. This design confines errors to individual tool calls and avoids re-planning entire execution trajectories. This structured execution paradigm enables a lightweight and reusable orchestration component for agentic systems. Experimental results show that our approach achieves robust tool execution while reducing execution complexity and overhead. Code will be made publicly available.
Figures & tables
Figure 1: Valid vs. invalid tool execution. Hallucinated premature computation from SLM before data parsing leads to cascading errors, producing a fluent but incorrect final answer report.
Figure 2: Overview of RETO. Left: layer assignment from the task query and tool descriptions. Top-right: repair loop for failed tool calls (schema gate → LLM repair) under a budget. Bottom-right: context-constrained execution with step-specific tool constraints; observations are carried across layers to produce the final answer.
Method
Backbone
Tool-tuned
I1-Inst.
I1-Tool
I1-Cat.
I2-Inst.
I2-Cat.
I3-Inst.
Avg.
Closed-source LLMs
ReAct
GPT-3.5-0613
–
50.1 ±0.6
51.6 ±0.4
49.8 ±0.3
37.3 ±0.8
40.3 ±0.7
43.2 ±1.5
45.4
ReAct
GPT-3.5-1106
–
49.8 ±1.2
51.3 ±1.3
40.1 ±0.3
39.8 ±1.2
49.2 ±0.7
59.6 ±0.8
48.3
Open-source LLMs
ReAct
ToolLLaMA-7B
✓
31.5 ±0.8
34.0 ±0.4
39.5 ±0.5
25.5 ±0.4
34.5 ±0.8
32.8 ±0.0
33.0
DFSDT
ToolLLaMA-7B
✓
48.8 ±2.4
48.9 ±1.0
48.9 ±0.4
37.3 ±0.4
45.8 ±1.0
53.0 ±2.0
47.1
Table 1: Solvable Pass Rate (%) on StableToolBench. Best results among open-source models are in bold ; underline denotes the second best. Tool-tuned indicates whether the backbone is tool-tuned (✓) or untuned (✗) ; – denotes closed-source baselines.
Figure 3: Solvable Win Rate (%) of open-source models against GPT-3.5-0613 + ReAct on StableToolBench, computed from per-instance comparisons; the dashed line marks 50% parity.
Figure 4: SoPR (%) across Qwen2.5 model sizes (0.5B–7B). Performance degrades gradually, with 3B and 1.5B remaining functional.
Figure 5: Ablation study on execution sketch and repair modules. We report SoPR (%) with Qwen2.5-7B on three test sets.
Total Tokens
Steps
Test Set
DFSDT
RETO
↓
DFSDT
RETO
↓
I1-Inst.
19586
5952
-69.6%
7.4
4.4
-40.5%
I1-Tool
20911
6009
-71.3%
6.8
4.0
-41.2%
I1-Cat.
12534
3022
-75.9%
5.6
2.7
-51.8%
I2-Inst.
23587
6530
-72.3%
8.5
4.5
-47.1%
I2-Cat.
17236
4885
-71.7%
6.9
3.2
-53.6%
Table 2: Efficiency comparison between ToolLLaMA + DFSDT and Qwen2.5-7B + RETO (Ours).
Figure 6: Sensitivity analysis of layer predictor hyperparameters. SoPR (%) on I1-Tool and I3-Inst. datasets with Qwen2.5-7B.
Figure 7: Case study on Qwen2.5-7B. Blue tools (t2, t5, t7) are task-relevant. Left: ReAct fails due to format collapse and response hallucination without calling any APIs. Right: RETO succeeds through layer-constrained execution with grounded responses.
Appendix figures & tables2 assets
Supplementary material from the paper’s appendix.
Appendix
I1-I
I1-C
I1-T
I2-I
I2-C
I3-I
Total
Full
200
200
200
200
200
100
1,100
Solvable
163
153
158
106
124
61
765
Appendix
Table 3: Statistics of StableToolBench test sets (from ( Guo et al., 2024 ) ).
LLaMA-3.1-8B
Qwen2.5-7B
ToolLLaMA-7B
Test Set
Win
Lose
Tie
Win
Lose
Tie
Win
Lose
Tie
I1-Inst.
41
110
12
74
88
1
95
68
0
I1-Tool
40
100
18
69
85
4
83
75
0
I1-Cat.
59
86
8
95
57
1
81
72
0
I2-Inst.
33
57
16
60
45
1
65
41
0
I2-Cat.
32
62
30
71
45
8
65
58
1
Appendix
Table 4: Win/Lose/Tie counts against GPT-3.5 + ReAct.
Agentic orchestration delegates tasks to sub-agents with independent contexts, providing a key path to extending the effective execution horizon of large language model agents. However, existing orchestration methods face two limitations: in execution, current methods fix sub-agents' goals and harnesses at creation time, limiting their adaptability to dynamic real-world environments; in optimization, sparse and delayed feedback constrains effective learning of the orchestration policy. To address these limitations, we introduce POrchestra, an on-the-fly proactive agentic orchestration framework. It allows sub-agents to proactively communicate with the orchestrator at any logical point to request harness adjustments while maintaining continuity of local execution. This mechanism not only enables sub-agents to adapt seamlessly to dynamic environments but also naturally inspires On-Policy Orchestration Distillation (OPOD) based on hindsight feedback. OPOD attributes sub-agents' proactive revision requests back to preceding orchestration decisions to derive targeted improvement signals, and leverages these signals as process supervision alongside the final reward to optimize the orchestration policy. We evaluate POrchestra on three long-horizon agent benchmarks spanning deep research, dynamic digital assistance, and software engineering. POrchestra improves task success by an average of 9.1% relative to the strongest baseline; combined with OPOD, it improves small-orchestrator success by an average of 10.0% relative to existing training baselines. POrchestra also achieves a more favorable cost-performance trade-off. Our code is publicly available at https://github.com/XueyangFeng/POrchestra.
Xueyang Feng, Chaozhuo Li, Xiaohe Bo +4
Gaoling School of Artificial Intelligence, Renmin University of China · Beijing Academy of Artificial Intelligence · The Chinese University of Hong Kong Shenzhen
The performance bottleneck of agents is increasingly shifting from model capability to the robustness of their execution processes. Tools play a central role as the primary interface through which agents interact with external environments, yet existing methods rarely focus on ensuring robust tool use across diverse runtime conditions. To address this problem, we propose ExpG, a mechanism that builds and refines adaptive guidance capturing each tool's capability boundaries and best practices, thereby enabling agents to use tools more robustly and effectively. ExpG consists of three phases: (1) experience acquisition, which analyzes tool invocation quality from historical execution trajectories, producing structured learnable experiences through multi-aspect attribution; (2) experience distillation, which keeps the experience pool effective by filtering unhelpful experiences, selecting representative ones with an equivalence-class-based method, and summarizing them into generalizable guidance; and (3) experience reuse, which applies the guidance adaptively during future task solving. Extensive experiments show that ExpG brings consistent improvements across the tool selection, tool calling, and response generation tasks, enabling smaller agents to outperform larger ones that do not use ExpG. Moreover, ExpG achieves particularly strong gains in challenging settings, suggesting a promising path toward more robust tool use. Our code, experiments, and results are available.
Can Wang, Haoran Chen, Li Yu +4
1Shandong Key Laboratory of Digital Service Computing Technology and Systems · 2Alibaba Token Hub · Department of Electrical and Electronic Engineering, The Hong Kong Polytechnic University
Multi-agent systems (MAS) demonstrate clear advantages in tackling complex problems by coordinating diverse agents and external tools. However, most existing orchestration methods rely on static workflows or serial agent scheduling, and are further constrained by heterogeneous interface protocols between tools and agents. This leads to high system complexity and poor extensibility. To mitigate these issues, we propose Agent-as-Tool, a unified parallel orchestration paradigm that abstracts both agents and tools into a standardized, learnable action space with protocol normalization and explicit state feedback. Building on this paradigm, we train a lightweight orchestrator, ParaManager, which decouples planning decisions from subtask solving, enabling state-aware parallel subtask decomposition, delegation, and asynchronous execution. For training, we adopt a two-stage ParaManager training pipeline. It improves robustness by incorporating supervised fine-tuning (SFT) trajectories equipped with recovery mechanisms, and further applies reinforcement learning (RL) to achieve an optimal balance among task success, protocol compliance, diversity, and reasoning efficiency. Experiments show that ParaManager achieves strong performance across multiple benchmarks and exhibits robust generalization under unseen model pools.
Wenzhen Yuan, Wutao Xiong, Fanchen Yu +7
Shanghai Jiao Tong University · Sichuan University · Shanghai AI Lab +2