Batch Sequential Adaptive Designs for Global Optimization

10/21/2020
by   Jianhui Ning, et al.
0

Compared with the fixed-run designs, the sequential adaptive designs (SAD) are thought to be more efficient and effective. Efficient global optimization (EGO) is one of the most popular SAD methods for expensive black-box optimization problems. A well-recognized weakness of the original EGO in complex computer experiments is that it is serial, and hence the modern parallel computing techniques cannot be utilized to speed up the running of simulator experiments. For those multiple points EGO methods, the heavy computation and points clustering are the obstacles. In this work, a novel batch SAD method, named "accelerated EGO", is forwarded by using a refined sampling/importance resampling (SIR) method to search the points with large expected improvement (EI) values. The computation burden of the new method is much lighter, and the points clustering is also avoided. The efficiency of the proposed SAD is validated by nine classic test functions with dimension from 2 to 12. The empirical results show that the proposed algorithm indeed can parallelize original EGO, and gain much improvement compared against the other parallel EGO algorithm especially under high-dimensional case. Additionally, we also apply the new method to the hyper-parameter tuning of Support Vector Machine (SVM). Accelerated EGO obtains comparable cross validation accuracy with other methods and the CPU time can be reduced a lot due to the parallel computation and sampling method.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
06/14/2016

The Parallel Knowledge Gradient Method for Batch Bayesian Optimization

In many applications of black-box optimization, one can evaluate multipl...
research
05/04/2020

Cross-validation based adaptive sampling for Gaussian process models

In many real-world applications, we are interested in approximating blac...
research
11/23/2015

Parallel Predictive Entropy Search for Batch Global Optimization of Expensive Objective Functions

We develop parallel predictive entropy search (PPES), a novel algorithm ...
research
03/18/2021

Learning How to Optimize Black-Box Functions With Extreme Limits on the Number of Function Evaluations

We consider black-box optimization in which only an extremely limited nu...
research
10/13/2019

Global optimization-based dimer method for finding saddle points

Searching saddle points on the potential energy surface is a challenging...
research
08/20/2023

An alternative to SVM Method for Data Classification

Support vector machine (SVM), is a popular kernel method for data classi...

Please sign up or login with your details

Forgot password? Click here to reset