Noisy optimization with sequential parameter optimization and optimal computational budget allocation

  • Authors:

  • Thomas Bartz-Beielstein;Martina Friese;Martin Zaefferer;Boris Naujoks;Oliver Flasch;Wolfgang Konen;Patrick Koch

  • Affiliations:

  • Cologne University of Applied Sciences, 51643 Gummersbach, Germany;Cologne University of Applied Sciences, 51643 Gummersbach, Germany;Cologne University of Applied Sciences, 51643 Gummersbach, Germany;Cologne University of Applied Sciences, 51643 Gummersbach, Germany;Cologne University of Applied Sciences, 51643 Gummersbach, Germany;Cologne University of Applied Sciences, 51643 Gummersbach, Germany;Cologne University of Applied Sciences, 51643 Gummersbach, Germany

  • Venue:
  • Proceedings of the 13th annual conference companion on Genetic and evolutionary computation
  • Year:
  • 2011

Quantified Score

Hi-index 0.00

Visualization

Abstract

Sequential parameter optimization (SPO) is a heuristic that combines classical and modern statistical techniques to improve the performance of search algorithms. In this study, SPO is directly used as an optimization method on different noisy mathematical test functions. SPO includes a broad variety of meta models, which can have significant impact on its performance. Additionally, Optimal Computing Budget Allocation (OCBA), which is an enhanced method for handling the computational budget spent for selecting new design points, is presented. The OCBA approach can intelligently determine the most efficient replication numbers. Moreover, we study the of performance of different meta models being integrated in SPO. Our results reveal that the incorporation of OCBA and the selection of Gaussian process models are highly beneficial. SPO outperformed three different alternative optimization algorithms on a set of five noisy mathematical test functions.