On Batch Bayesian Optimization
We present two algorithms for Bayesian optimization in the batch feedback setting, based on Gaussian process upper confidence bound and Thompson sampling approaches, along with frequentist regret guarantees and numerical results.
Code (0)
등록된 구현이 없습니다.
Tasks
Bayesian OptimizationThompson SamplingMethods 이 논문이 사용한 방법론
Similar Papers 제목 키워드 기반
A Simple and Efficient Approach to Batch Bayesian Optimization
Extending Bayesian optimization to batch evaluation can enable the designer to make the most use of parallel computing technology. However, most of current batch approaches do not scale well with the batch size. That is,…
Bayesian OptimizationAn Efficient Asynchronous Batch Bayesian Optimization Approach for Analog Circuit Synthesis
In this paper, we propose EasyBO, an Efficient ASYnchronous Batch Bayesian Optimization approach for analog circuit synthesis. In this proposed approach, instead of waiting for the slowest simulations in the batch to fin…
Bayesian OptimizationDiversityBatch Bayesian Optimization via Multi-objective Acquisition Ensemble for Automated Analog Circuit Design
Bayesian optimization methods are promising for the optimization of black-box functions that are expensive to evaluate. In this paper, a novel batch Bayesian optimization approach is proposed. The parallelization is…
Bayesian OptimizationDiversified Sampling for Batched Bayesian Optimization with Determinantal Point Processes
In Bayesian Optimization (BO) we study black-box function optimization with noisy point evaluations and Bayesian priors. Convergence of BO can be greatly sped up by batching, where multiple evaluations of the black-box f…
Bayesian OptimizationDiversityPoint ProcessesThompson SamplingB3O: Scalable Boltzmann Batch Bayesian Optimization
Modern engineering workflows increasingly rely on massive parallel simulation, driving the need for scalable, large-batch Bayesian Optimization (BO). Existing batch BO methods, however, incur large computational cost or …