REVIEW 1 cited by
Multi-Step Bayesian Optimization for One-Dimensional Feasibility Determination
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
read the original abstract
Bayesian optimization methods allocate limited sampling budgets to maximize expensive-to-evaluate functions. One-step-lookahead policies are often used, but computing optimal multi-step-lookahead policies remains a challenge. We consider a specialized Bayesian optimization problem: finding the superlevel set of an expensive one-dimensional function, with a Markov process prior. We compute the Bayes-optimal sampling policy efficiently, and characterize the suboptimality of one-step lookahead. Our numerical experiments demonstrate that the one-step lookahead policy is close to optimal in this problem, performing within 98% of optimal in the experimental settings considered.
Forward citations
Cited by 1 Pith paper
-
Cost-aware Stopping for Bayesian Optimization
A cost-aware stopping rule for Bayesian optimization, equivalent to stopping when no point's expected improvement per cost exceeds 1, is proved to be no worse than immediate stopping and matches or beats baselines emp...
Discussion (0). Continue with ORCID to comment.