Initial Design Strategies and their Effects on Sequential Model-Based Optimization
Not on the map. Why?
Abstract (arXiv)
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.
Key facts. Cited by 10 papers in the map (data through 7 Oct 2026). First posted on arXiv 30 Mar 2020.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2021: 1; 2022: 5; 2023: 1; 2024: 1; 2025: 1; 2026: 1.
10 papers.
- 2021Hyperparameter Optimization: Foundations, Algorithms, Best Practices and Open Challengescited by 143
- 2022Multi-Objective Hyperparameter Optimization in Machine Learning -- An Overviewcited by 37
- 2022A Collection of Deep Learning-based Feature-Free Approaches for Characterizing Single-Objective Continuous Fitness Landscapescited by 8
- 2022PI is back! Switching Acquisition Functions in Bayesian Optimizationcited by 6
- 2023Self-Adjusting Weighted Expected Improvement for Bayesian Optimizationcited by 5
- 2022Faster variational quantum algorithms with quantum kernel-based surrogate modelscited by 3
- 2022Towards Automated Design of Bayesian Optimization via Exploratory Landscape Analysiscited by 2
- 2025Informed Initialization for Bayesian Optimization and Active Learningcited by 2
- 2024HO-FMN: Hyperparameter Optimization for Fast Minimum-Norm Attackscited by 0
- 2026mlr3mbo: Bayesian Optimization in Rcited by 0
- 2026mlr3mbo: Bayesian Optimization in R31 Mar 2026
- 2025Informed Initialization for Bayesian Optimization and Active Learning27 Oct 2025
- 2024HO-FMN: Hyperparameter Optimization for Fast Minimum-Norm Attacks11 Jul 2024
- 2023Self-Adjusting Weighted Expected Improvement for Bayesian Optimization7 Jun 2023
- 2022Towards Automated Design of Bayesian Optimization via Exploratory Landscape Analysis17 Nov 2022
- 2022PI is back! Switching Acquisition Functions in Bayesian Optimization2 Nov 2022
- 2022Faster variational quantum algorithms with quantum kernel-based surrogate models2 Nov 2022
- 2022Multi-Objective Hyperparameter Optimization in Machine Learning -- An Overview15 Jun 2022
- 2022A Collection of Deep Learning-based Feature-Free Approaches for Characterizing Single-Objective Continuous Fitness Landscapes12 Apr 2022
- 2021Hyperparameter Optimization: Foundations, Algorithms, Best Practices and Open Challenges13 Jul 2021