RouteMoA: Dynamic Routing without Pre-Inference Boosts Efficient Mixture-of-Agents (2026.acl-long)
Copied to clipboard
Jize Wang, Han Wu, Zhiyuan You, Yiming Song, Yijun Wang, Zifei Shan, Yining Li, Songyang Zhang, Xinyi Le, Cailian Chen, Xinping Guan, Dacheng Tao
| Challenge: | Existing methods for mixing-of-agents (MoA) lack model selection criteria and struggle with large model pools. |
| Approach: | They propose a mixture-of-agents framework with dynamic routing that uses a lightweight scorer to perform initial screening and refines the model scores through self- and cross-assessment. |
| Outcome: | The proposed framework outperforms existing methods for large model pools and tasks . it reduces cost by 89.8% and latency by 63.6% in the large-scale model pool. |
Similar Papers
MixLLM: Dynamic Routing in Mixed Large Language Models (2025.naacl-long)
Copied to clipboard
Xinyuan Wang, Yanchi Liu, Wei Cheng, Xujiang Zhao, Zhengzhang Chen, Wenchao Yu, Yanjie Fu, Haifeng Chen
| Challenge: | Large Language Models (LLMs) exhibit potential artificial generic intelligence, however, their usage is costly with high response latency. |
| Approach: | They develop a dynamic contextual-bandit-based routing system for query-LLM assignment that leverages query tags to enhance query embeddings. |
| Outcome: | The proposed model maximizes response quality and minimizes cost and latency. |
RouterHGC: Optimized Router for LLM-based Multi-Agent Systems via Heterogeneous Graph Contrastive Learning (2026.findings-acl)
Copied to clipboard
| Challenge: | Large Language Models (LLMs)-driven Multi-Agent Systems (MAS) have demonstrated remarkable scalability and generalizability across complex tasks. |
| Approach: | They propose a new framework for routing using large language models . they formalize routing as node selection through edge-weight prediction . |
| Outcome: | The proposed framework outperforms the best single LLM and baselines on five datasets . it achieves 0.80%–6.17% accuracy gains on MATH and HotpotQA while reducing inference cost by 27.40%. |
MasRouter: Learning to Route LLMs for Multi-Agent Systems (2025.acl-long)
Copied to clipboard
| Challenge: | Multi-agent systems (MAS) powered by Large Language Models (LLMs) have been demonstrated to push the boundaries of LLM capabilities, yet they often face significant costs and challenges in dynamic LLM selection. |
| Approach: | They propose a multi-agent system routing solution that integrates all components of MAS into a unified routing framework. |
| Outcome: | The proposed solution is high-performing, cost-effective, and efficient . it reduces overhead by up to 52.07 compared to current methods on HumanEval . |
Select-then-Route : Taxonomy guided Routing for LLMs (2025.emnlp-industry)
Copied to clipboard
| Challenge: | Large language models have boosted performance across a broad spectrum of tasks . sending each query to the most suitable model is prohibitively expensive . |
| Approach: | They propose a framework that selects a small pool of LLMs and routes queries through an adaptive cascade. |
| Outcome: | The proposed framework improves accuracy and latency by 4X while reducing inference cost. |
Can We Predict Before Executing Machine Learning Agents? (2026.acl-long)
Copied to clipboard
| Challenge: | Existing approaches to scientific discovery rely on expensive physical execution . a Generate-Execute-Feedback paradigm is costly and slow . |
| Approach: | They propose to internalize execution priors to substitute costly runtime checks with instantaneous predictive reasoning, drawing inspiration from World Models. |
| Outcome: | The proposed framework achieves 61.5% accuracy and robust confidence calibration when primed with a Verified Data Analysis Report. |
TensorOpera Router: A Multi-Model Router for Efficient LLM Inference (2024.emnlp-industry)
Copied to clipboard
Dimitris Stripelis, Zhaozhuo Xu, Zijian Hu, Alay Shah, Han Jin, Yuhang Yao, Jipeng Zhang, Tong Zhang, Salman Avestimehr, Chaoyang He
| Challenge: | Large Language Models (LLMs) have demonstrated remarkable performance across a diverse set of domain-specific tasks. |
| Approach: | They propose a non-monolithic LLM querying system that seamlessly integrates various LLM experts into a single query interface and dynamically routes incoming queries to the most high-performant expert based on query’s requirements. |
| Outcome: | The proposed model improves query efficiency by 40% and costs by 30% while maintaining or enhancing model performance by 10%. |
Maximum Score Routing For Mixture-of-Experts (2025.findings-acl)
Copied to clipboard
| Challenge: | Traditional mixture-of-experts (MoE) networks impose an expert capacity constraint to ensure GPU-friendly computation. |
| Approach: | They propose a routing paradigm that dynamically allocates input tokens to top-k experts through differentiable sparse transformations, enabling scalable model capacity while preserving computational efficiency. |
| Outcome: | The proposed model achieves lower training losses and higher evaluation scores at equivalent FLOPs compared to constrained and unconstrained baselines. |
DSMoE: Matrix-Partitioned Experts with Dynamic Routing for Computation-Efficient Dense LLMs (2025.emnlp-main)
Copied to clipboard
Minxuan Lv, Zhenpeng Su, Leiyu Pan, Yizhe Xiong, Zijia Lin, Hui Chen, Wei Zhou, Jungong Han, Guiguang Ding, Wenwu Ou, Di Zhang, Kun Gai, Songlin Hu
| Challenge: | Existing sparsification methods like pruning can lose model knowledge through parameter removal. |
| Approach: | They propose a novel approach that achieves sparsification by partitioning pre-trained FFN layers into computational blocks. |
| Outcome: | The proposed approach achieves superior performance across language modeling and downstream tasks under equivalent computational constraints. |
HyperMoE: Towards Better Mixture of Experts via Transferring Among Experts (2024.acl-long)
Copied to clipboard
| Challenge: | Existing methods for enhancing performance through increased use of expert knowledge often result in diminishing sparsity during expert selection. |
| Approach: | They propose a framework that integrates the computational processes of MoE with the concept of knowledge transferring in multi-task learning. |
| Outcome: | The proposed framework outperforms existing methods under identical conditions concerning the number of experts. |
Generalising LLM Routing using Past Performance Retrieval: A Few-Shot Router is Sufficient (2026.eacl-srw)
Copied to clipboard
| Challenge: | Large Language Models (LLMs) use a single LLM to perform tasks. |
| Approach: | They propose a meta-evaluation framework that predicts per-model performance for new queries by retrieving similar past queries and reweighting model scores with lightweight attention. |
| Outcome: | The proposed framework matches the quality–cost trade-offs of generalisable routers across five routing benchmarks. |