English

MixLLM: Dynamic Routing in Mixed Large Language Models

Computation and Language 2025-02-27 v1 Artificial Intelligence Databases Information Retrieval

Abstract

Large Language Models (LLMs) exhibit potential artificial generic intelligence recently, however, their usage is costly with high response latency. Given mixed LLMs with their own strengths and weaknesses, LLM routing aims to identify the most suitable model for each query in the stream to maximize response quality and minimize cost and latency. However, the challenges involve: (1) dynamic trade-offs among quality, cost, and latency; (2) enabling continual learning in deployed systems; and (3) navigating a varying (e.g., new LLM addition or old LLM removal) set of LLM candidates over time. To bridge these gaps, we develop MixLLM, a dynamic contextual-bandit-based routing system for query-LLM assignment. Specifically, we first leverage query tags to enhance query embeddings for the routing task. Next, we design lightweight prediction models to estimate the response qualities and costs of queries over LLMs. We then devise a meta-decision maker to choose the query-LLM assignments to best tradeoff response quality, cost, and latency. Finally, the system benefits from continual training, allowing it to adapt to evolving queries and user feedback over time. Our extensive experiments show that MixLLM achieves the best trade-offs in response quality, cost, and latency (97.25% of GPT-4's quality at 24.18% of the cost under the time constraint).

Keywords

Cite

@article{arxiv.2502.18482,
  title  = {MixLLM: Dynamic Routing in Mixed Large Language Models},
  author = {Xinyuan Wang and Yanchi Liu and Wei Cheng and Xujiang Zhao and Zhengzhang Chen and Wenchao Yu and Yanjie Fu and Haifeng Chen},
  journal= {arXiv preprint arXiv:2502.18482},
  year   = {2025}
}

Comments

11 pages, 7 figures, accepted by NAACL 2025 main conference

R2 v1 2026-06-28T21:57:43.876Z