Skip to content

Budget-Aware LLM Discovery via Cost-Calibrated Frontier Utility

Jul 2026 · arXiv.org · Vol abs/2607.26828 · 0 citations · 42 references
Computer Science

TL;DR

CostAda is introduced, a cost-calibrated adaptive controller built around a cost-calibrated frontier utility that reaches the strongest baseline's full-budget quality with at most half the budget on twelve of sixteen benchmark--backbone pairs while achieving the strongest mean final quality on all eight benchmarks under GLM-5 and GPT-5.

Abstract

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. We prove that cost-blind credit can forfeit all but a vanishing fraction of attainable quality as frontiers multiply and costs diverge. Under a fixed search-side token budget, the controller must decide which frontier is improving and whether its gain justifies the realized cost before the budget is exhausted. We introduce \textbf{CostAda}, a cost-calibrated adaptive controller built around \emph{cost-calibrated frontier utility}. The utility values frontier progress relative to realized action cost and conditions that credit on the remaining budget. CostAda uses this signal to control local exploration intensity, frontier allocation, and budgeted tactic intervention. Cost and remaining budget therefore shape the search rather than serving only as accounting variables or a stopping rule. CostAda reaches the strongest baseline's full-budget quality with at most half the budget on twelve of sixteen benchmark--backbone pairs while achieving the strongest mean final quality on all eight benchmarks under GLM-5 and GPT-5.4.

View source

Similar papers

Preprint Aug 2026

Exploit More, Explore Smarter for Budget-Constrained Agentic Search

This work introduces ExTS, a tree-search policy that treats expansion itself as a value-of-information decision, and introduces pilot-run diagnostics that characterize what makes budget-constrained agentic search problems structurally different from one another, providing both understanding of the problem space and pra...

Haoyang Fang, Bernie Wang · 2 citations
Jul 2026

Search as Computation Allocation

Under an explicit frontier-resolution and heuristic-error model, maximizing approximate VOC recovers weighted A*, with A* and greedy best-first search as limiting cases.

Alexander Tuisov · 0 citations
Preprint Aug 2026

EcoAgent-Bench: Evaluating Economic Decision-Making in Budget-Constrained LLM Agents

EcoAgent-Bench is introduced, in which every task specifies priced actions and an explicit budget, and results show that completion under a budget and economical action selection are distinct properties.

Jie Wu, Ming Gong, Feixiang Cheng et al. · 1 citation

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.