Breaking the Tie: A Cluster-Aware Routing Framework for Large Language Models
Not on the map. Why?
Abstract (arXiv)
With the rapid development of artificial intelligence, the emergence of various Large Language Models (LLMs) has created a rich model ecosystem. However, this also brings a key challenge: how to select the optimal model for a specific user query. LLM routing addresses this need by dynamically assigning queries to the most suitable expert in the pool of candidate models. However, existing routing frameworks often simplify this process to a standard classification task; thus, a critical vulnerability is exposed when multiple candidate models correctly answer the same query. We formalize this capability overlap as routing noise, which misleads the router with arbitrarily correct candidate models, ultimately leading to routing collapse (a severe decline in generalization ability on unseen tasks). To address this problem, we propose a novel Cluster-Aware Soft-Labeling Routing (CASLR) framework. CASLR shifts the evaluation paradigm from the success of a single query to macro-domain consensus by replacing traditional one-hot vectors with a masked softmax mechanism. Specifically, for experts who answer incorrectly, we penalize their target probability to zero; for the remaining candidates, we directly compute continuous fine-grained soft labels based on their global clustering utility scores. We then use these refined soft labels to supervise a lightweight router. Specifically, the framework not only demonstrates superior accuracy on multiple benchmarks, but also outperforms Llama-3.3-70B-Instruct by 7.80% in overall average performance. Furthermore, the extremely low routing inference latency of only 1.13s further confirms that CASLR can achieve efficient system scheduling with almost zero additional overhead, while ensuring high response quality.
Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 24 of its 35 references that are in the map. First posted on arXiv 5 Oct 2026.
Builds on
24 of 35 references.
References · 24
- 2018BERT: Pre-training of Deep Bidirectional Transformers for Language Understandingcited by 40,399
- 2020Measuring Massive Multitask Language Understandingcited by 7,963
- 2021Measuring Mathematical Problem Solving With the MATH Datasetcited by 5,371
- 2019HellaSwag: Can a Machine Really Finish Your Sentence?cited by 4,100
- 2021Program Synthesis with Large Language Modelscited by 3,637
- 2021Switch Transformers: Scaling to Trillion Parameter Models with Simple and Efficient Sparsitycited by 3,073
- 2020DeBERTa: Decoding-enhanced BERT with Disentangled Attentioncited by 2,181
- 2020GShard: Scaling Giant Models with Conditional Computation and Automatic Shardingcited by 1,631
- 2016Google's Neural Machine Translation System: Bridging the Gap between Human and Machine Translationcited by 1,475
- 2024Qwen2.5-Math Technical Report: Toward Mathematical Expert Model via Self-Improvementcited by 1,090
- 2021GLaM: Efficient Scaling of Language Models with Mixture-of-Expertscited by 897
- 2021Scaling Vision with Sparse Mixture of Expertscited by 747
12 more
- 2024GSM-Symbolic: Understanding the Limitations of Mathematical Reasoning in Large Language Modelscited by 550
- 2019Multi-Task Deep Neural Networks for Natural Language Understandingcited by 350
- 2024RouterBench: A Benchmark for Multi-LLM Routing Systemcited by 238
- 2024GraphRouter: A Graph-based Router for LLM Selectionscited by 165
- 2025Router-R1: Teaching LLMs Multi-Round Routing and Aggregation via Reinforcement Learningcited by 72
- 2025BEST-Route: Adaptive LLM Routing with Test-Time Optimal Computecited by 67
- 2025RouterEval: A Comprehensive Benchmark for Routing LLMs to Explore Model-level Scaling Up in LLMscited by 61
- 2024TensorOpera Router: A Multi-Model Router for Efficient LLM Inferencecited by 60
- 2024Harnessing the Power of Multiple Minds: Lessons Learned from LLM Routingcited by 46
- 2024Reassessing Layer Pruning in LLMs: New Insights and Methodscited by 24
- 2025The Structural Scalpel: Automated Contiguous Layer Pruning for Large Language Modelscited by 2
- 2026Mapping Text to Multiplex Graph: Prompt Compression as L'evy Walk-Guided Graph Pruningcited by 1
Built on by
Not cited yet.