Bayesian Optimization with a Finite Budget: An Approximate Dynamic Programming Approach

We consider the problem of optimizing an expensive objective function when a finite budget of total evaluations is prescribed. In that context, the optimal solution strategy for Bayesian optimization can be formulated as a dynamic programming instance.