- Rating
- 3
- Confidence
- 3
- Informativeness
- 2
- Presentation
- 3
- Soundness
- 3
Read review
Paper summary
The paper proposes a multi-agent orchestration framework organized around three stages: Create, Coordinate, and Conclude. The framework dynamically creates specialized workers, manages information exchange between them through a meta-agent, and aggregates their outputs into a final response.
The approach is evaluated on GAIA, GPQA Diamond, Omni-MATH, and HumanEval, achieving competitive or superior performance against a broad set of baselines. Additional experiments on GAIA and Omni-MATH examine the contributions of individual components, communication strategies, and key architectural parameters.
Critical strengths
-
Thoughtful integration of agent specialization, memory, and communication. The framework combines task-specific worker creation with meta-agent-controlled information exchange based on workers' states and memory. The selective communication mechanism is particularly interesting, as it offers a structured alternative to indiscriminate context sharing. Although the individual ideas build on prior work, their integration into a unified orchestration framework is a meaningful contribution.
-
Strong experimental analysis and clear presentation. The paper is well organized, with Algorithm 1, Figure 1, and equations making the architecture accessible despite its complexity. The evaluation covers multiple benchmarks and numerous baselines. Ablations on GAIA and Omni-MATH examine individual modules, communication strategies, worker counts, and checkpoint intervals. Together with detailed case studies and failure analyses in the appendix, these experiments provide substantial evidence supporting the design choices.
Critical weaknesses
-
Limited clarity of the contribution beyond existing agent orchestration approaches. The three stages of the framework address problems that have already received considerable attention. While their integration is well executed, it remains unclear which aspects represent fundamentally new mechanisms rather than an effective combination of existing techniques. Similar high-level orchestration capabilities are also present in practical agentic systems such as Claude Code and Codex. A more explicit comparison of the proposed coordination and memory mechanisms with these approaches would help establish the paper's distinct contribution.
-
Insufficient evidence regarding the efficiency of the proposed orchestration. Repeated meta-agent interventions and inter-agent communication introduce additional computational and coordination overhead. Although the accuracy improvements are promising, the evaluation does not sufficiently clarify their trade-offs in terms of token usage, monetary cost, and end-to-end latency. Without this information, it is difficult to assess whether the additional architectural complexity is justified by the performance gains.
Questions for authors
-
Cost efficiency. Could the authors report average token consumption and estimated API cost per task for the proposed framework and the evaluated baselines? Since Gemini 2.5 Flash is relatively inexpensive, it would be particularly interesting to determine whether the performance improvements translate into a favorable cost–accuracy trade-off.
-
Execution latency. How does the end-to-end execution time compare with the baselines? The repeated checkpoints and meta-agent interventions may introduce substantial overhead, even when workers operate in parallel. Reporting average or median wall-clock latency would help clarify the practical implications of this design.
-
Communication patterns. Could the authors report the average number of inter-agent communication events per checkpoint, including the frequency of checkpoints with no communication and those with extensive communication? This would help assess how selectively the meta-agent establishes communication and how these decisions relate to computational overhead.
-
Scope of the orchestration framework. The current architecture is restricted to parallel workers independently solving the complete task. Have authors considered the meta-agent that also construct workflows involving dependent subtasks with sequentially working agents? Similarly, can the framework support selecting different backbone models for different workers?
4 comments
Response to Reviewer GYxV Part 2
Q4. Dependent sub-tasks and heterogeneous backbones
Dependent workflows. The current implementation does not construct dependent workflows as the five workers each attempt the full query in parallel, and the router selects transfers between active workers. However, the lifecycle abstraction extends naturally to this setting. The meta-author could emit sub-tasks with a dependency graph, each node being launched when its prerequisites finish, and the router would then route within the permitted edges of that graph, with the evidence buffer carrying upstream results as provenance-tagged packets exactly as it carries lateral evidence now. Flash Searcher (DAG execution) and ROMA (recursive dependency-aware trees) operate on similar themes. TANGO's contribution would be to add selective, verifiable evidence transfer along the edges and evidence-based synthesis at the join points.
Heterogeneous backbones. The worker specification already carries a model identifier, so assigning different models to different workers or roles is supported by the implementation, however we leave that for future work and have not explored it in our manuscript.
Thank you for the detailed responses and additional experiments. I appreciate the effort the authors have put into addressing my concerns. The new results clarify several important aspects of the method, particularly its computational costs, latency, and communication patterns. However, my main concern regarding the novelty of the proposed approach relative to existing agent orchestration methods remains only partially addressed. While the rebuttal strengthens the paper, I do not believe it fully resolves this concern. I therefore maintain my positive assessment and original score.
Thank you for the thoughtful follow-up and for maintaining your positive assessment. Your questions have given us a clearer view of what to pursue next. The latency and communication analyses showed how task-dependent routing demand is, which motivates an adaptive routing schedule, and asynchronous communication between workers to remove the checkpoint barriers and reduce latency. Beyond that, we will explore dependency-aware workflows with sequential sub-tasks and to support heterogeneous backbones per worker. We also take the point on novelty seriously and will sharpen the contrast with manager-led systems in the final version. We appreciate the insight these questions provided.
Response to Reviewer GYxV Part 1
We thank the reviewer for the positive assessment of the integration and the analysis, and for the four precise questions. Questions 1–3 are answered quantitatively in the common response and we further discuss them here, and answer W1 and Q4 in full.
W1. What is new relative to existing orchestration
We do not claim to have invented worker specialization, agent memory or sparse communication and each has precedents that we cite. The contribution is (a) the specific coordination mechanism and (b) the evidence that the three lifecycle stages interact and must be adapted together.
Comparison with Claude Code, Codex and the open manager-led systems. These systems are manager-led: a single orchestrator decomposes the task, delegates sub-tasks to subagents. Communication is vertical and happens when a subagent finishes and subagents do not see each other's intermediate state. TANGO differs in three mechanisms. First, all workers attempt the whole task, so the system's robustness comes from strategy and tool diversity rather than from a correct decomposition. Second, communication is lateral and mid-trajectory: the router reads structured states of all workers at checkpoints and copies specific evidence from one worker to another while both are still active. Third, the final decision is made over terminal structured memories and tool evidence, not over the workers' answers or a manager's running summary, and Table 6 shows this matters (final answers alone: −11.1 GAIA A@3 points). Magentic-One, AOrchestra and Flash Searcher are the open analogues of the manager-led pattern and are in Table 1 with their own tool stacks. TANGO obtains higher A@3 than all three on GAIA, GPQA-Diamond and Omni-MATH with a smaller tool catalogue.
What the evidence adds beyond "a good combination". Table 2 shows the stages are not additive as routing lowers accuracy when added to fixed workers with a synthesizer but raises it with authored workers. Similarly, structured memory does nothing under dense sharing but is the best configuration under selective routing (Table 3). A system that fixes any one stage cannot exhibit, or exploit, these interactions.
W2 / Q1. Cost efficiency
Table A gives per-task tokens and cost for TANGO and the sampling baselines with the paper's backbone, and Table B does the same for Gemini-3.5-Flash. With Gemini-2.5-Flash, TANGO costs more than Majority Vote (15) on GAIA for +11.9 A@3 points and 47% less on Omni-MATH for +0.9 points. With Gemini-3.5-Flash, TANGO is cheaper than Majority Vote (15) on both benchmarks. The favourable trade-off comes from using five workers instead of fifteen and from keeping the controller's output small, also TANGO uses fewer model steps per task.
Q2. Execution latency
Table C reports mean, median and P90 wall-clock per task. On GAIA, TANGO's median is 3.97 minutes versus 2.43 for Majority Vote (15) and 0.85 for ReAct and 4.59 versus 2.04 and 0.97 on Omni-MATH. TANGO makes far fewer model calls than Majority Vote (15) but more of them are on the critical path. The author call precedes all workers, each checkpoint is a barrier where the workers wait for one router call, and synthesis follows the last worker. Majority Vote's latency is just its slowest trajectory. Two mitigations follow directly from Table D. First, routing demand is task-dependent: 86% of GAIA checkpoints return no route and the empty fraction rises from 67% at the first checkpoint to 87% by the fifth, whereas on Omni-MATH 77% of checkpoints carry routes, so an adaptive routing schedule would remove most barrier waits on GAIA-like tasks with little effect on what is routed. Second, routing can run asynchronously, delivering packets at the recipient's next turn without pausing the others. We have added the latency table and this discussion to Appendix E and to the Limitations (Section 6).
Q3. Communication patterns
Table D answers this over the GAIA and Omni-MATH runs. On GAIA the router is consulted often but rarely acts. It is called about seven times per task, yet 86% of those calls return no route, and the traffic it does send is front-loaded with 1.3 routes per call at the first checkpoint falling to 0.3 by the fifth. On Omni-MATH the router is consulted less than three times per task but acts on three out of four calls, sending two routes per call on average. The router is therefore not uniformly sparse. It is sparse where workers’ intermediate states are of little use to each other and dense where they are, which depends on the task itself and is the behaviour a task-adaptive policy should have. Its overhead is the reading of five structured states at every checkpoint, and that reading is wasted mainly on GAIA-like tasks where most checkpoints are empty. This is why we point to an adaptive routing schedule, rather than to further payload reduction, as the next step.