Budget-Aware LLM Discovery via Cost-Calibrated Frontier Utility
Not on the map. Why?
Abstract (arXiv)
Large language models increasingly support scientific and algorithmic discovery through inference-time search over evaluated candidates. Existing adaptive discovery controllers assign credit based only on score progress, even though prompt length, retries, and guidance calls cause search actions to incur different token costs. Under a fixed search budget, the controller must decide which frontier to develop and whether its gain justifies the realized cost before the budget is exhausted. We prove that, in the worst case, cost-blind control can forfeit all but a vanishing fraction of attainable quality as frontier count and cost heterogeneity grow. To address this limitation, we introduce CostAda, an adaptive controller built on cost-calibrated frontier utility. By valuing progress relative to realized action cost and conditioning credit on the remaining budget, CostAda coordinates local exploration intensity, frontier allocation, and budgeted tactic intervention. Realized action cost and remaining budget therefore shape the search rather than serving only as accounting variables or a stopping rule. Across eight benchmarks with GLM-5 and GPT-5.4, CostAda reaches the strongest baseline's full-budget quality with at most half the budget on thirteen of sixteen benchmark--backbone pairs and achieves the strongest final quality on all sixteen pairs.
Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 32 of its 46 references that are in the map. First posted on arXiv 29 Jul 2026.
Builds on
32 of 46 references.
References · 32
- 2023Tree of Thoughts: Deliberate Problem Solving with Large Language Modelscited by 3,211
- 2025AlphaEvolve: A coding agent for scientific and algorithmic discoverycited by 867
- 2023Large Language Models as Optimizerscited by 864
- 2023Promptbreeder: Self-Referential Self-Improvement Via Prompt Evolutioncited by 551
- 2025GEPA: Reflective Prompt Evolution Can Outperform Reinforcement Learningcited by 542
- 2024Automated Design of Agentic Systemscited by 407
- 2024ReEvo: Large Language Models as Hyper-Heuristics with Reflective Evolutioncited by 276
- 2024Evolution of Heuristics: Towards Efficient Automatic Algorithm Design Using Large Language Modelcited by 268
- 2024Token-Budget-Aware LLM Reasoningcited by 247
- 2025ShinkaEvolve: Towards Open-Ended And Sample-Efficient Program Evolutioncited by 174
- 2013Bandits with Knapsackscited by 164
- 2024LLM-SR: Scientific Equation Discovery via Programming with Large Language Modelscited by 133
20 more
- 2026Learning to Discover at Test Timecited by 115
- 2024LLaMEA: A Large Language Model Evolutionary Algorithm for Automatically Generating Metaheuristicscited by 97
- 2026AdaEvolve: Adaptive LLM Driven Zeroth-Order Optimizationcited by 60
- 2026EvoX: Meta-Evolution for Automated Discoverycited by 60
- 2026CORAL: Towards Autonomous Multi-Agent Evolution for Open-Ended Discoverycited by 52
- 2025SelfBudgeter: Adaptive Token Allocation for Efficient LLM Reasoningcited by 48
- 2025Budget-Aware Tool Use Enables Effective Agent Scalingcited by 44
- 2024Evolving Code with A Large Language Modelcited by 43
- 2025Reasoning on a Budget: A Survey of Adaptive and Controllable Test-Time Compute in LLMscited by 31
- 2025BudgetThinker: Empowering Budget-aware LLM Reasoning with Control Tokenscited by 29
- 2026DeltaEvolve: Accelerating Scientific Discovery through Momentum-Driven Evolutioncited by 26
- 2026Structured Scaling of AI Discovery Across Diverse Scientific Domainscited by 21
- 2025AgentTTS: Large Language Model Agent for Test-time Compute-optimal Scaling Strategy in Complex Taskscited by 16
- 2026Inference-Time Budget Control for LLM Search Agentscited by 13
- 2025The Art of Scaling Test-Time Compute for Large Language Modelscited by 12
- 2025BAMAS: Structuring Budget-Aware Multi-Agent Systemscited by 6
- 2026Aligning Tree-Search Policies with Fixed Token Budgets in Test-Time Scaling of LLMscited by 4
- 2026PACEvolve++: Improving Test-time Learning for Evolutionary Search Agentscited by 4
- 2026Compute Allocation for Self-Evolving LLMs: From Depth-Breadth to Multi-Armed Banditscited by 4
- 2026TurboEvolve: Towards Fast and Robust LLM-Driven Program Evolutioncited by 3
Built on by
Not cited yet.