中文
相关论文

相关论文: When Routing Collapses: On the Degenerate Converge…

200 篇论文

As LLMs proliferate with diverse capabilities and costs, LLM routing has emerged by learning to predict each LLM's quality and cost for a given query, then selecting the one with high quality and low cost. However, existing routers…

计算与语言 · 计算机科学 2026-02-04 Jiaqi Xue , Qian Lou , Jiarong Xing , Heng Huang

Large language models (LLMs) exhibit impressive capabilities across a wide range of tasks, yet the choice of which model to use often involves a trade-off between performance and cost. More powerful models, though effective, come with…

Large language models (LLMs) deliver superior performance but require substantial computational resources and operate with relatively low efficiency, while smaller models can efficiently handle simpler tasks with fewer resources. LLM…

数据库 · 计算机科学 2025-12-01 Kai Mei , Wujiang Xu , Minghao Guo , Shuhang Lin , Yongfeng Zhang

Large language models (LLMs) excel in most NLP tasks but also require expensive cloud servers for deployment due to their size, while smaller models that can be deployed on lower cost (e.g., edge) devices, tend to lag behind in terms of…

Modern LLM deployments confront a widening cost-performance spectrum: premium models deliver strong reasoning but are expensive, while lightweight models are economical yet brittle on complex tasks. Static escalation rules and keyword…

Large language model (LLM) query routers are critical to modern AI platforms as they seek to improve efficiency by assigning inference queries to accurate, yet low-cost models. Parametric routers typically use trained neural networks for…

机器学习 · 计算机科学 2025-10-14 Shivam Patel , Neharika Jali , Ankur Mallick , Gauri Joshi

Large Language Models (LLMs) have achieved remarkable performance in Machine Translation (MT), but deploying them at scale remains prohibitively expensive. A widely adopted remedy is the hybrid system paradigm, which balances cost and…

计算与语言 · 计算机科学 2026-04-27 Yingfeng Luo , Hongyu Liu , Dingyang Lin , Kaiyan Chang , Chenglong Wang , Bei Li , Quan Du , Tong Xiao , Jingbo Zhu

With the rapid growth in the number of Large Language Models (LLMs), there has been a recent interest in LLM routing, or directing queries to the cheapest LLM that can deliver a suitable response. We conduct a minimax analysis of the…

LLM routers aim to balance quality and cost of generation by classifying queries and routing them to a cheaper or more expensive LLM depending on their complexity. Routers represent one type of what we call LLM control planes: systems that…

密码学与安全 · 计算机科学 2025-01-06 Avital Shafran , Roei Schuster , Thomas Ristenpart , Vitaly Shmatikov

A key strategy for balancing performance and cost in modern machine learning systems is to dynamically route queries to either a low-cost model or a more expensive oracle (such as a large pretrained model or human expert), an approach known…

机器学习 · 计算机科学 2026-05-11 Charlotte Peale , Siddartha Devic , Parikshit Gopalan , Udi Wieder , Aravind Gollakota

Large Language Models (LLMs) process every token through all layers of a transformer stack, causing wasted computation on simple queries and insufficient flexibility for harder ones that need deeper reasoning. Adaptive-depth methods can…

计算与语言 · 计算机科学 2026-05-20 Ahmed Heakl , Martin Gubri , Salman Khan , Sangdoo Yun , Seong Joon Oh

Model routing is a simple technique for reducing the inference cost of large language models (LLMs), wherein one maintains a pool of candidate LLMs, and learns to route each prompt to the smallest feasible LLM. Existing works focus on…

Multimodal large language models (MLLMs) have heterogeneous strengths across OCR, chart understanding, spatial reasoning, visual question answering, cost, and latency. Effective MLLM routing therefore requires more than estimating query…

人工智能 · 计算机科学 2026-05-13 Xueqi Cheng , Yushun Dong

Large language models (LLMs) are powerful tools but are often expensive to deploy at scale. LLM query routing mitigates this by dynamically assigning queries to models of varying cost and quality to obtain a desired trade-off. Prior query…

LLM routing aims to select the most appropriate model for each query, balancing competing performance metrics such as accuracy and cost across a pool of language models. Prior approaches typically adopt a decoupled strategy, where the…

人工智能 · 计算机科学 2026-01-05 Asterios Tsiourvas , Wei Sun , Georgia Perakis

Recently, the number of off-the-shelf Large Language Models (LLMs) has exploded with many open-source options. This creates a diverse landscape regarding both serving options (e.g., inference on local hardware vs remote LLM APIs) and model…

机器学习 · 计算机科学 2024-12-18 Dimitrios Sikeridis , Dennis Ramdass , Pranay Pareek

The rapid emergence of diverse large language models (LLMs) has spurred the development of LLM routers that assign user queries to the most suitable model. However, existing LLM routers typically perform a single-round, one-to-one mapping…

计算与语言 · 计算机科学 2025-10-27 Haozhen Zhang , Tao Feng , Jiaxuan You

Multi-turn, long-horizon tasks are increasingly common for large language models (LLMs), but solving them typically requires many sequential model invocations, accumulating substantial inference costs. Here, we study cost-aware multi-turn…

计算与语言 · 计算机科学 2026-04-28 Yiqun Zhang , Hao Li , Zihan Wang , Shi Feng , Xiaocui Yang , Daling Wang , Bo Zhang , Lei Bai , Shuyue Hu

Recent advancements in multi-model AI systems have leveraged LLM routers to reduce computational cost while maintaining response quality by assigning queries to the most appropriate model. However, as classifiers, LLM routers are vulnerable…

密码学与安全 · 计算机科学 2026-01-30 Wenhui Zhang , Huiyu Xu , Zhibo Wang , Zhichao Li , Zeqing He , Xuelin Wei , Kui Ren

Large language models (LLMs) often exhibit complementary strengths. Model routing harnesses these strengths by dynamically directing each query to the most suitable model, given a candidate model pool. However, routing performance relies on…

机器学习 · 计算机科学 2025-11-17 Chenxu Wang , Hao Li , Yiqun Zhang , Linyao Chen , Jianhao Chen , Ping Jian , Peng Ye , Qiaosheng Zhang , Shuyue Hu
‹ 上一页 1 2 3 10 下一页 ›