ECHOROUTER: Forecast-Guided Evolution of Runtime-Adaptive Multi-Agent Systems
Abstract
Multi-agent systems face a recurring decision: after each intermediate result, is another model call worth its cost? The right amount of collaboration varies dramatically: hardly needs an agent, while an attempt at a Navier–Stokes proof may call for many specialists. Making this decision requires choosing how agents collaborate, which models to assign, what context each call receives, and when to stop under a budget. Code-based workflow optimizers such as AFlow can express conditional execution, but searching through repeated real rollouts is costly, especially on multi-turn tasks. We introduce EchoRouter, which uses experience from past execution trajectories as an “echo” to understand where the current policy stands and guide subsequent search. During optimization, it proposes diverse candidate policies, each decomposed into three decisions: how to collaborate during task execution, which models to assign, and what each call receives and returns. Guided by the echo, EchoRouter treats LLM as value model to forecast candidate quality and cost, executes promising policies, reflects on their trajectories, and updates the echo. It also compares models and prompts on saved task states while hiding model names to improve credit assignment. During execution, a lightweight controller uses the selected policy and current task state to construct subgraphs, assign models, and specify each call's prompt and output format. Across various model-pool scales and mathematical, coding, and general reasoning benchmarks, EchoRouter achieves quality–cost trade-offs. Results on multi-turn tasks and open-ended artifact generation further show competitive quality under an LLM as Judge evaluation. Its decoupled, model-anonymous design allows new LLMs to be assessed without rebuilding the collaboration policy. Together, these results demonstrate the effectiveness and potential of EchoRouter.
est. 32% chance this paper gets accepted at ICLR 2027.
What do you think this paper will get?
All positions stay anonymous.