Batch sequential adaptive designs for global optimization
From MaRDI portal
Abstract: 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.
Recommendations
- Balancing global and local search in parallel efficient global optimization algorithms
- A parallel Bayesian optimization method based on adaptive surrogate model
- Parallel Bayesian global optimization of expensive functions
- Pseudo expected improvement criterion for parallel EGO algorithm
- Efficient global optimization algorithm with additive and coupled model
Cites work
- scientific article; zbMATH DE number 53679 (Why is no real title available?)
- scientific article; zbMATH DE number 2231192 (Why is no real title available?)
- A taxonomy of global optimization methods based on response surfaces
- Batch sequential designs for computer experiments
- Bayesian algorithms for one-dimensional global optimization
- Design and analysis of computer experiments. With comments and a rejoinder by the authors
- Efficient global optimization algorithm assisted by multiple surrogate techniques
- Efficient global optimization of expensive black-box functions
- Global optimization of stochastic black-box systems via sequential kriging meta-models
- Support points
- The design and analysis of computer experiments
- Theory and application of uniform experimental designs
Cited in
(5)- Sequentially weighted uniform designs
- A parallel Bayesian optimization method based on adaptive surrogate model
- Pseudo expected improvement criterion for parallel EGO algorithm
- TREGO: a trust-region framework for efficient global optimization
- Balancing global and local search in parallel efficient global optimization algorithms
Describes a project that uses
Uses Software
This page was built for publication: Batch sequential adaptive designs for global optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2089024)
