You don't need the most expensive LLM for every task—smart routing between models using bandit algorithms can produce better solutions at lower cost by adapting which model to use based on real-time performance.
This paper presents Ballad, a bandit algorithm that dynamically selects which LLM to use at each step of automated heuristic discovery for combinatorial optimization. Rather than assuming larger models are always better, Ballad learns to orchestrate multiple LLMs into an ensemble that outperforms any single model while cutting costs by up to 66%.