Global Optimization with Sparse and Local Gaussian Process Models

Krityakierne, Tipaluck; Ginsbourger, David (2015). Global Optimization with Sparse and Local Gaussian Process Models. In: Pardalos, Panos; Pavone, Mario; Farinella, Giovanni Maria; Cutello, Vincenzo (eds.) Machine Learning, Optimization, and Big Data. Lecture Notes in Computer Science: Vol. 9432 (pp. 185-196). Cham: Springer 10.1007/978-3-319-27926-8_16

Text chp%3A10.1007%2F978-3-319-27926-8_16.pdf - Published Version Restricted to registered users only Available under License Publisher holds Copyright. Download (402kB) | Request a copy

We present a novel surrogate model-based global optimization framework allowing a large number of function evaluations. The method, called SpLEGO, is based on a multi-scale expected improvement (EI) framework relying on both sparse and local Gaussian process (GP) models. First, a bi-objective approach relying on a global sparse GP model is used to determine potential next sampling regions. Local GP models are then constructed within each selected region. The method subsequently employs the standard expected improvement criterion to deal with the exploration-exploitation trade-off within selected local models, leading to a decision on where to perform the next function evaluation(s). The potential of our approach is demonstrated using the so-called Sparse Pseudo-input GP as a global model. The algorithm is tested on four benchmark problems, whose number of starting points ranges from 102 to 104. Our results show that SpLEGO is effective and capable of solving problems with large number of starting points, and it even
provides significant advantages when compared with state-of-the-art EI
algorithms.

Interest & Impact

Downloads

5 since deposited on 07 Apr 2016
0 in the past 12 months

Citations

5 Citations in Web of Science ®
6 Citations in Scopus

Search

in Google Scholar™

Services

Actions (login required)

Edit item

Actions (login required)

Edit item