Efficient Rollout Strategies for Bayesian Optimization
원문 초록
Bayesian optimization (BO) is a class of sample-efficient global optimization methods, where a probabilistic model conditioned on previous observations is used to determine future evaluations via the optimization of an acquisition function. Most acquisition functions are myopic, meaning that they only consider the impact of the next function evaluation. Non-myopic acquisition functions consider the impact of the next $h$ function evaluations and are typically computed through rollout, in which $h$ steps of BO are simulated. These rollout acquisition functions are defined as $h$-dimensional integrals, and are expensive to compute and optimize. We show that a combination of quasi-Monte Carlo, common random numbers, and control variates significantly reduce the computational burden of rollout. We then formulate a policy-search based approach that removes the need to optimize the rollout acquisition function. Finally, we discuss the qualitative behavior of rollout policies in the setting of multi-modal objectives and model error.
함께 살펴볼 논문
공통 태그를 근거로 연결했습니다. 실제 인용 관계나 논문의 우수성을 뜻하지 않습니다.
Improving LLM-based Global Optimization with Search Space Partitioning
Global optimization of graph acquisition functions for neural architecture search
Regularized infill criteria for multi-objective Bayesian optimization with application to aircraft design
Bayesian Optimization for Robust Identification of Ornstein-Uhlenbeck Model
BARK: A Fully Bayesian Tree Kernel for Black-box Optimization
Deterministic Global Optimization of the Acquisition Function in Bayesian Optimization: To Do or Not To Do?
토론
이 논문과 연결된 포럼 글이 아직 없습니다.