Researchers have developed a new contextual bandit policy called ADP-HT designed to optimize the allocation of tasks to large language models (LLMs) within fixed budgets. This policy learns task-specific success probabilities and estimates costs using coarsened response-length labels, aiming to maximize the number of tasks solved before a budget is exhausted. ADP-HT demonstrated superior performance on benchmarks like MATH500, GPQA, RouterBench, and LiveCodeBench, outperforming existing baselines and even a deployed commercial router under tight budget constraints. AI
IMPACT Optimizes LLM usage and cost-efficiency for organizations operating under budget constraints.
RANK_REASON Research paper detailing a new algorithm for LLM routing. [lever_c_demoted from research: ic=1 ai=1.0]
AI-generated summary · Google Gemini · from 1 sources. How we write summaries →