paper-with-me

홈 › Papers

Dynamic Model Routing and Cascading for Efficient LLM Inference: A Survey

2026-02-23 · Yasmin Moslem, John D. Kelleher arxiv

The rapid growth of large language models (LLMs) with diverse capabilities, costs, and domains has created a critical need for intelligent model selection at inference time. While smaller models suffice for routine queries, complex tasks demand more capable models. However, static model deployment does not account for the complexity and domain of incoming queries, leading to suboptimal performance and increased costs. Dynamic routing systems that adaptively select models based on query characteristics have emerged as a solution to this challenge. We provide a systematic analysis of state-of-the-art multi-LLM routing and cascading approaches. In contrast to mixture-of-experts architectures, which route within a single model, we study routing across multiple independently trained LLMs. We cover diverse routing paradigms, including query difficulty, human preferences, clustering, uncertainty quantification, reinforcement learning, multimodality, and cascading. For each paradigm, we analyze representative methods and examine key trade-offs. Beyond taxonomy, we introduce a conceptual framework that characterizes routing systems along three dimensions: when decisions are made, what information is used, and how they are computed. This perspective highlights that practical systems are often compositional, integrating multiple paradigms under operational constraints. Our analysis demonstrates that effective multi-LLM routing requires balancing competing objectives. Choosing the optimal routing strategy depends on deployment and computational constraints. Well-designed routing systems can outperform even the most powerful individual models by strategically leveraging specialized capabilities across models while maximizing efficiency gains. Meanwhile, open challenges remain in developing routing mechanisms that generalize across diverse architectures, modalities, and applications.

📄 PDF Abstract BibTeX arXiv:2603.04445

Code (0)

등록된 구현이 없습니다.

Tasks

Reinforcement Learning

Similar Papers 제목 키워드 기반

Pay for Hints, Not Answers: LLM Shepherding for Cost-Efficient Inference

2026-01-29 · Ziming Dong, Hardik Sharma, Evan O'Toole, Jaya Prakash Champati 외 arxiv

Large Language Models (LLMs) deliver state-of-the-art performance on complex reasoning tasks, but their inference costs limit deployment at scale. Small Language Models (SLMs) offer dramatic cost savings yet lag substant…

Mathematical ReasoningCode Generation

Towards Efficient Multi-LLM Inference: Characterization and Analysis of LLM Routing and Hierarchical Techniques

2025-06-06 · Adarsh Prasad Behera, Jaya Prakash Champati, Roberto Morabito, Sasu Tarkoma 외

Recent progress in Language Models (LMs) has dramatically advanced the field of natural language processing (NLP), excelling at tasks like text generation, summarization, and question answering. However, their inference …

BenchmarkingModel SelectionQuestion AnsweringText Generation

A Unified Approach to Routing and Cascading for LLMs

2024-10-14 · Jasper Dekoninck, Maximilian Baader, Martin Vechev

The widespread applicability of large language models (LLMs) has increased the availability of many fine-tuned models of various sizes targeting specific tasks. Given a set of such specialized models, to maximize overall…

Model Selection

TRIM: Hybrid Inference via Targeted Stepwise Routing in Multi-Step Reasoning Tasks

2026-01-15 · Vansh Kapoor, Aman Gupta, Hao Chen, Anurag Beniwal 외 arxiv

Multi-step reasoning tasks like mathematical problem solving are vulnerable to cascading failures, where a single incorrect step leads to complete solution breakdown. Current LLM routing methods assign entire queries to …

Agreement-Based Cascading for Efficient Inference

2024-07-02 · Steven Kolawole, Don Dennis, Ameet Talwalkar, Virginia Smith

Adaptive inference schemes reduce the cost of machine learning inference by assigning smaller models to easier examples, attempting to avoid invocation of larger models when possible. In this work we explore a simple, ef…