CASTER: Breaking the Cost-Performance Barrier in Multi-Agent Orchestration via Context-Aware Strategy for Task Efficient Routing
Shanyv Liu, Xuyang Yuan, Tao Chen, Zijun Zhan, Zhu Han, Danyang Zheng, Weishan Zhang, Shaohua Cao
TL;DR
CASTER addresses the cost-performance paradox in graph-based multi-agent systems by introducing a context-aware router that combines semantic task content with structural context to dynamically allocate sub-tasks to appropriate model backends. It employs a Dual-Branch Feature Fusion Network to predict the need for a strong vs. weak model and is integrated as a per-step interceptor in LangGraph, enabling on-demand routing with rollback. The training pipeline combines a Cold Start pre-training phase with an Iterative Evolution phase using on-policy negative feedback, achieving up to 72.4% inference cost reduction while maintaining or improving task success across Software, Data, Science, and Security domains, outperforming FrugalGPT and heuristic routing. The approach is domain-agnostic and promotes greener AI by reducing compute and latency, with potential for broader applications beyond the current four domains.
Abstract
Graph-based Multi-Agent Systems (MAS) enable complex cyclic workflows but suffer from inefficient static model allocation, where deploying strong models uniformly wastes computation on trivial sub-tasks. We propose CASTER (Context-Aware Strategy for Task Efficient Routing), a lightweight router for dynamic model selection in graph-based MAS. CASTER employs a Dual-Signal Router that combines semantic embeddings with structural meta-features to estimate task difficulty. During training, the router self-optimizes through a Cold Start to Iterative Evolution paradigm, learning from its own routing failures via on-policy negative feedback. Experiments using LLM-as-a-Judge evaluation across Software Engineering, Data Analysis, Scientific Discovery, and Cybersecurity demonstrate that CASTER reduces inference cost by up to 72.4% compared to strong-model baselines while matching their success rates, and consistently outperforms both heuristic routing and FrugalGPT across all domains.
