Model Guided Sampling Optimization for Low-dimensional Problems

08/31/2015
by   Lukas Bajer, et al.
0

Optimization of very expensive black-box functions requires utilization of maximum information gathered by the process of optimization. Model Guided Sampling Optimization (MGSO) forms a more robust alternative to Jones' Gaussian-process-based EGO algorithm. Instead of EGO's maximizing expected improvement, the MGSO uses sampling the probability of improvement which is shown to be helpful against trapping in local minima. Further, the MGSO can reach close-to-optimum solutions faster than standard optimization algorithms on low dimensional or smooth problems.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
10/16/2022

Study of the Fractal decomposition based metaheuristic on low-dimensional Black-Box optimization problems

This paper analyzes the performance of the Fractal Decomposition Algorit...
research
12/24/2020

High-Dimensional Bayesian Optimization via Tree-Structured Additive Models

Bayesian Optimization (BO) has shown significant success in tackling exp...
research
02/16/2023

Robust expected improvement for Bayesian optimization

Bayesian Optimization (BO) links Gaussian Process (GP) surrogates with s...
research
12/06/2011

Entropy Search for Information-Efficient Global Optimization

Contemporary global optimization algorithms are based on local measures ...
research
04/19/2017

The True Destination of EGO is Multi-local Optimization

Efficient global optimization is a popular algorithm for the optimizatio...
research
11/20/2018

Sampling Can Be Faster Than Optimization

Optimization algorithms and Monte Carlo sampling algorithms have provide...

Please sign up or login with your details

Forgot password? Click here to reset