Latin Hypercube Designs with Branching and Nested Factors for Initialization of Automatic Algorithm Configuration
- 1 March 2019
- journal article
- research article
- Published by MIT Press in Evolutionary Computation
- Vol. 27 (1) , 129-145
Abstract
The configuration of algorithms is a laborious and difficult process. Thus, it is advisable to automate this task by using appropriate automatic configuration methods. The [ ] method is among the most widely used in the literature. By default, [ ] initializes its search process via uniform sampling of algorithm configurations. Although better initialization methods exist in the literature, the mixed-variable (numerical and categorical) nature of typical parameter spaces and the presence of conditional parameters make most of the methods not applicable in practice. Here, we present an improved initialization method that overcomes these limitations by employing concepts from the design and analysis of computer experiments with branching and nested factors. Our results show that this initialization method is not only better, in some scenarios, than the uniform sampling used by the current version of [ ], but also better than other initialization methods present in other automatic configuration methods.Keywords
This publication has 23 references indexed in Scilit:
- Ant Colony Optimization: A Component-Wise Overview2018
- AClib: A Benchmark Library for Algorithm Configuration2014
- Sequential Model-Based Optimization for General Algorithm Configuration2011
- On Energy, Discrepancy and Group Invariant Measures on Measurable Subsets of Euclidean SpaceJournal of Fourier Analysis and Applications, 2010
- Tuning Metaheuristics2009
- Solving Bilevel Multi-Objective Optimization Problems Using Evolutionary Algorithms2009
- Improvement Strategies for the F-Race Algorithm: Sampling Design and Iterative Refinement2007
- The Design and Analysis of Computer Experiments2003
- Introduction to Evolutionary Computing2003
- The Quadratic Assignment Problem1998