AI RESEARCH

Cost-aware Stopping for Bayesian Optimization

arXiv CS.LG

ArXi:2507.12453v5 Announce Type: replace In automated machine learning, scientific discovery, and other applications of Bayesian optimization, deciding when to stop evaluating expensive black-box functions in a cost-aware manner is an important but underexplored practical consideration. A natural performance metric for this purpose is the cost-adjusted simple regret, which explicitly captures the trade-off between solution quality and cumulative evaluation cost.