arXiv:2505.19947cs.LGcs.AI2025-05NeurIPS被引 7

智能调度大模型,省钱又保证回答质量。

MESS+: Dynamically Learned Inference-Time LLM Routing in Model Zoos with Service Level Guarantees

  • 实时学习模型响应满意度,动态选最优模型。
  • 相比现有方法平均节省2倍推理成本。
  • 适合关注性价比和稳定服务的开发者。

开放权重的大语言模型(LLM)库提供了众多高质量模型,但为特定任务选择合适模型仍具挑战性,需专业技术知识。多数用户仅希望获得事实准确、安全且满意的回答,而推理服务提供商则关注降低运营成本。两者利益冲突通常通过服务等级协议(SLA)来调和,以保障最低服务质量。我们提出MESS+,一种基于随机优化的算法,在确保严格SLA合规的前提下实现成本最优的LLM请求路由。MESS+在用户交互过程中实时学习各模型的请求满足概率,并据此求解每个请求的优化问题以决定模型选择。算法结合了虚拟队列与请求满意度预测的新方法,并提供了成本最优性和约束满足性的理论分析。在多个主流LLM基准测试中,MESS+相比现有路由技术平均实现2倍成本节约。

原文摘要 · Abstract (English)

Open-weight large language model (LLM) zoos provide access to numerous high-quality models, but selecting the appropriate model for specific tasks remains challenging and requires technical expertise. Most users simply want factually correct, safe, and satisfying responses without concerning themselves with model technicalities, while inference service providers prioritize minimizing operating costs. These competing interests are typically mediated through service level agreements (SLAs) that guarantee minimum service quality. We introduce MESS+, a stochastic optimization algorithm for cost-optimal LLM request routing while providing rigorous SLA compliance guarantees. MESS+ learns request satisfaction probabilities of LLMs in real-time as users interact with the system, based on which model selection decisions are made by solving a per-request optimization problem. Our algorithm includes a novel combination of virtual queues and request satisfaction prediction, along with a theoretical analysis of cost optimality and constraint satisfaction. Across a wide range of state-of-the-art LLM benchmarks, MESS+ achieves an average of $2\times$ cost savings compared to existing LLM routing techniques.

大模型调度成本优化SLA保障

Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。