AI Paper Atlas

Research map / Large language models / Agents, code and math

Ballad: Bandit-Based LLM Routing for Automated Heuristic Discovery

Samidha Verma, Ankit Anand, Sayan Ranu

NeurIPS 2026 · Large language models › Agents, code and math · approach: LLMs for optimization and heuristics · 0 citations (OpenAlex)

Read the paper

AI-extracted summary. Written by AI from the paper's abstract only. Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.

Proposes Ballad, a bandit-based router that selects among LLMs during automated heuristic discovery, arguing that the most expensive models do not consistently yield better heuristics.

Problem

Automated heuristic discovery (AHD) uses LLMs to iteratively mutate and refine heuristics for NP-hard combinatorial optimization problems, but it is unclear which LLM to use at each step, since larger and more expensive models do not consistently produce better heuristics.

Approach

Treats choice of LLM at each mutation step as a multi-armed bandit problem, routing queries across models to balance heuristic quality and cost rather than always using the most powerful model.

Key results

Surprising findings

Closest papers by meaning

Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.

Open scime draft

Get the next scime Dispatch and a monthly field update

Free. We send a confirmation link first; every email has a one-click unsubscribe. Privacy