CARROT: A Cost Aware Rate Optimal Router
About
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 routing problem, providing a lower bound and finding that a simple router that predicts both cost and accuracy for each question can be minimax optimal. Inspired by this, we introduce CARROT, a Cost AwaRe Rate Optimal rouTer that selects a model based on estimates of the models' cost and performance. Alongside CARROT, we also introduce the Smart Price-aware ROUTing (SPROUT) dataset to facilitate routing on a wide spectrum of queries with the latest state-of-the-art LLMs. Using SPROUT and prior benchmarks such as Routerbench and open-LLM-leaderboard-v2 we empirically validate CARROT's performance against several alternative routers.
Related benchmarks
| Task | Dataset | Result | Rank | |
|---|---|---|---|---|
| Coding | Coding Tasks (test) | Pass@195 | 42 | |
| Deep search | Deep Search Tasks (test) | Pass@186.3 | 42 | |
| Routing | SPROUT (test) | Accuracy89.9 | 11 | |
| Routing | RouterBench (test) | Accuracy74.9 | 11 | |
| LLM Routing | RouterBench held-out (test) | Accuracy74.9 | 6 | |
| LLM Routing | MMLU-Pro non-STEM | AUDC67 | 3 |