Initial design strategies and their effects on sequential model-based optimization
Authors:
Open Access
- 25 June 2020
- conference paper
- Published by Association for Computing Machinery (ACM)
- p. 778-786
Abstract
Sequential model-based optimization (SMBO) approaches are algorithms for solving problems that require computationally or otherwise expensive function evaluations. The key design principle of SMBO is a substitution of the true objective function by a surrogate, which is used to propose the point(s) to be evaluated next. SMBO algorithms are intrinsically modular, leaving the user with many important design choices. Significant research efforts go into understanding which settings perform best for which type of problems. Most works, however, focus on the choice of the model, the acquisition function, and the strategy used to optimize the latter. The choice of the initial sampling strategy, however, receives much less attention. Not surprisingly, quite diverging recommendations can be found in the literature. We analyze in this work how the size and the distribution of the initial sample influences the overall quality of the efficient global optimization (EGO) algorithm, a well-known SMBO approach. While, overall, small initial budgets using Halton sampling seem preferable, we also observe that the performance landscape is rather unstructured. We furthermore identify several situations in which EGO performs unfavorably against random sampling. Both observations indicate that an adaptive SMBO design could be beneficial, making SMBO an interesting test-bed for automated algorithm design.Keywords
All Related Versions
This publication has 24 references indexed in Scilit:
- The Impact of Initial Designs on the Performance of MATSuMoTo on the Noiseless BBOB-2015 Testbed2015
- MOI-MBO: Multiobjective Infill for Parallel Model-Based Optimization2014
- Hyper-heuristics: a survey of the state of the artJournal of the Operational Research Society, 2013
- Sequential Model-Based Optimization for General Algorithm Configuration2011
- Completely Derandomized Self-Adaptation in Evolution StrategiesEvolutionary Computation, 2001
- Parameter control in evolutionary algorithmsIEEE Transactions on Evolutionary Computation, 1999
- Mersenne twisterACM Transactions on Modeling and Computer Simulation, 1998
- On the distribution of points in a cube and the approximate evaluation of integralsUSSR Computational Mathematics and Mathematical Physics, 1967
- A Simplex Method for Function MinimizationThe Computer Journal, 1965
- On the efficiency of certain quasi-random sequences of points in evaluating multi-dimensional integralsNumerische Mathematik, 1960