Initial Design Strategies and their Effects on Sequential Model-Based Optimization
Authors:
- Jakob BossekJBJakob Bossek
- Carola DoerrCDCarola Doerr
- Pascal KerschkePKPascal Kerschke
Preprint
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
- Version 1, 2020-03-30, ArXiv
- Published version: , 778.
This publication has 14 references indexed in Scilit:
- Weighted integration over a hyperrectangle based on digital nets and sequencesJournal of Computational and Applied Mathematics, 2021
- COCO: a platform for comparing continuous optimizers in a black-box settingOptimization Methods and Software, 2020
- Taking the Human Out of the Loop: A Review of Bayesian OptimizationProceedings of the IEEE, 2015
- Parameter Control in Evolutionary Algorithms: Trends and ChallengesIEEE Transactions on Evolutionary Computation, 2014
- Hyper-heuristics: a survey of the state of the artJournal of the Operational Research Society, 2013
- ParEGO: a hybrid algorithm with on-line landscape approximation for expensive multiobjective optimization problemsIEEE Transactions on Evolutionary Computation, 2006
- Another Random Scrambling of Digital (t,s)-Sequences2002
- Completely Derandomized Self-Adaptation in Evolution StrategiesEvolutionary Computation, 2001
- Efficient Global Optimization of Expensive Black-Box FunctionsJournal of Global Optimization, 1998
- On the efficiency of certain quasi-random sequences of points in evaluating multi-dimensional integralsNumerische Mathematik, 1960