mlsanityData to 14 Oct 2026

Cost-Optimal LLM Routing with Limited User Feedback under User Satisfaction Guarantees

arXiv 2606.19376 ↗First posted 12 Jun 2026cs.LG cs.AI cs.IRcited by 3

Not on the map. Why?

Abstract (arXiv)

Inference costs for large language model (LLM) applications are rapidly growing, driven by surging demand and rising infrastructure cost. Users expect high-quality responses, and in commercial settings this is formally codified in Service Level Agreements (SLAs), creating a fundamental tension between cost and quality. Recent progress on cost-aware LLM request routing has shown potential to resolve this tension, but existing approaches rely on complete feedback signals, offline training, extensive per-workload tuning, and most lack SLA guarantees or inference-time adaptivity. We introduce SLARouter, an online routing algorithm that learns a cost-optimal policy from the sparse, one-sided user feedback available in production systems. SLARouter provides theoretical guarantees for both cost optimality and strict SLA compliance. Experiments across a wide range of LLM benchmarks show that SLARouter satisfies SLA constraints without the need for per-benchmark tuning, reducing operating cost by up to 2.2x over existing baselines.

Key facts. Cited by 3 papers in the map (data through 14 Oct 2026). Builds on 25 of its 29 references that are in the map. First posted on arXiv 12 Jun 2026.

Builds on

25 of 29 references.

References · 25

  1. 2021Training Verifiers to Solve Math Word Problemscited by 10,109
  2. 2023Judging LLM-as-a-Judge with MT-Bench and Chatbot Arenacited by 8,626
  3. 2020Measuring Massive Multitask Language Understandingcited by 7,963
  4. 2018Think you have Solved Question Answering? Try ARC, the AI2 Reasoning Challengecited by 4,886
  5. 2023GPQA: A Graduate-Level Google-Proof Q&A Benchmarkcited by 2,879
  6. 2019BoolQ: Exploring the Surprising Difficulty of Natural Yes/No Questionscited by 2,183
  7. 2016The LAMBADA dataset: Word prediction requiring a broad discourse contextcited by 992
  8. 2023FrugalGPT: How to Use Large Language Models While Reducing Cost and Improving Performancecited by 853
  9. 2017Crowdsourcing Multiple Choice Science Questionscited by 765
  10. 2024RouteLLM: Learning to Route LLMs with Preference Datacited by 682
  11. 2023A Comprehensive Overview of Large Language Modelscited by 648
  12. 2024Hybrid LLM: Cost-Efficient and Quality-Aware Query Routingcited by 372
13 more
  1. 2023From Words to Watts: Benchmarking the Energy Costs of Large Language Model Inferencecited by 170
  2. 2023AutoMix: Automatically Mixing Language Modelscited by 125
  3. 2024RouterDC: Query-Based Router by Dual Contrastive Learning for Assembling Large Language Modelscited by 88
  4. 2024TensorOpera Router: A Multi-Model Router for Efficient LLM Inferencecited by 60
  5. 2024ACPBench: Reasoning about Action, Change, and Planningcited by 39
  6. 2025CARROT: A Cost Aware Rate Optimal Routercited by 39
  7. 2025Causal LLM Routing: End-to-End Regret Minimization from Observational Datacited by 28
  8. 2025xRouter: Training Cost-Aware LLMs Orchestration System via Reinforcement Learningcited by 17
  9. 2025LLM DNA: Tracing Model Evolution via Functional Representationscited by 15
  10. 2022Breaking Feedback Loops in Recommender Systems with Causal Inferencecited by 14
  11. 2025MESS+: Dynamically Learned Inference-Time LLM Routing in Model Zoos with Service Level Guaranteescited by 9
  12. 2025Lookahead Routing for Large Language Modelscited by 5
  13. 2026PROTEUS: SLA-Aware Routing via Lagrangian RL for Multi-LLM Serving Systemscited by 4

Built on by

Cited by year (2026 to 14 Oct)

Citing papers per year: 2026: 3.

3 papers.