Routing Should Pay for Itself: Sparse Supervision for Economical LLM Routing

Guannan Lai, Gelin Bian, Hao-Xuan Ma, Jun-Peng Jiang, Long Chen, Jian-Dong Liu, Zhi-Hao Tan, Han-Jia Ye

Nanjing University · The Hong Kong University of Science and Technology · SinapisAI

Published September 29, 2026 · on the feed September 30, 2026 · ▲ 16 · arXiv 2609.37402

The abstract

Large language model (LLM) routing reduces serving cost by assigning each query to an appropriate model while preserving response quality. Learning such a router, however, often requires executing multiple candidate models on historical queries to collect query--model quality feedback, creating a nontrivial supervision cost before deployment. Existing work largely focuses on serving-time efficiency, overlooking whether the resulting savings are sufficient to recover this upfront expenditure. We further observe that routing quality often saturates well before all query--model feedback is collected, suggesting that dense supervision can be economically over-provisioned. We propose SaveRouter, a sparse-supervision routing framework that selectively acquires informative model feedback and shares capability information across related queries, while retaining query-level refinement for fine-grained routing. We evaluate routing by jointly accounting for supervision expenditure and subsequent serving-time savings. Across four routing benchmarks, the main setting uses only about 33--41% of available training feedback while maintaining competitive or better routing quality, and reduces the break-even deployment volume by approximately 1.9--9.5 times compared with the fastest conventional router. Further analysis shows that acquiring more supervision is not always economically preferable: the supervision level that minimizes serving cost can differ from the one that achieves the earliest payback. Our code is publicly available at https://github.com/LAMDA-Model-Reuse/SaveRouter.

The Brief

2:34

A short podcast summary of the paper. Written and voiced by AI.

Transcript

Routing Should Pay for Itself. Sparse Supervision for Economical LLM Routing. By Guannan Lai and seven others, from Nanjing University, the Hong Kong University of Science and Technology, and one other institution. Published on the twenty-ninth of September. Its code repository is public and real: about twenty-five source files.

Routing for large language models cuts serving cost by sending each query to an appropriate model while preserving response quality. Learning such a router, however, often means running several candidate models on historical queries, to collect feedback on quality for each pairing of query and model. That is a supervision cost, and it is paid before deployment. Existing work has largely focused on efficiency at serving time, and overlooked whether the resulting savings are enough to recover the upfront expense.

The authors add an observation. Routing quality often saturates well before all of that feedback is collected, which suggests that dense supervision can be economically over-provisioned.

SaveRouter is a sparse-supervision routing framework. It acquires model feedback selectively, going after the informative pieces, and it shares capability information across related queries. Query-level refinement is retained, so routing can still be fine-grained. The idea is that related queries reveal much the same thing about which models can handle them, so not every query needs every model run on it. Shared information covers what is common, and per-query refinement covers what is particular.

The evaluation changes to match. Routing is judged by accounting jointly for what supervision cost and for what it later saves at serving time. That makes the break-even deployment volume, how much use a router needs before it has paid for itself, a central measure. A router that saves a little on each query but cost a great deal to train may take a long time to come out ahead. Counting both sides of the ledger makes that visible.

Across four routing benchmarks, the main setting uses only about thirty-three to forty-one percent of the available training feedback, while keeping routing quality competitive or better. Compared with the fastest conventional router, it reduces the break-even deployment volume by approximately one point nine to nine point five times. Further analysis finds that acquiring more supervision is not always economically preferable. The level of supervision that minimizes serving cost can differ from the level that achieves the earliest payback.

The title sets the standard: routing should pay for itself. Judged that way, the question is not only how cheap a router makes each query, but how many queries it takes before the feedback it consumed is earned back. Less feedback, chosen well, moves that point much closer.

Paper Quest · 7 chapters · about 41 min

Play this paper

Learn it by doing: make the calls the authors made, guess the result before you see it, and defend it in a viva graded on your own words. Chapter 1 is right here.

Chapter 1 🧩 · The problem

Saving money starts by spending it. Here the wall is the bill for feedback, paid before the router saves a cent.

You want to cut serving cost by sending each query to a cheaper model when it will do. To learn where to send queries, you first run several candidate models on old queries and score their answers.

The road ahead

  1. 1 · The problem ~7 min Learning where to send queries means paying to score many models on old queries, and that bill comes before any saving.
  2. 2 · What came before ~3 min
  3. 3 · The key idea ~9 min Pay only for the feedback that shapes routing choices, fill gaps from related queries, refine per query, and judge the router by when it pays back.
  4. 4 · Choose your own research ~3 min
  5. 5 · Build the method ~8 min Collect a few well-chosen scores, pool them by query group, correct per query, then send each query to the best value model.
  6. 6 · The experiment ~6 min You’ll guess: To keep routing quality competitive, what share of the available training feedback did the main setting of the sparse router use?
  7. 7 · The viva ~5 min Three questions from the examiners, answered in your own words. Win it for the paper’s trophy.
Join free to play the whole quest ›

Free, with Google or an email address. Your stars and progress are kept.

KipQuest: the day’s AI research, as podcasts and quests. All papers Android app Privacy Contact Episodes are written and voiced by AI from each paper. Summaries can contain mistakes: the paper is the source.