Latin Hypercube Designs with Branching and Nested Factors for Initialization of Automatic Algorithm Configuration.
Saved in:
| Title: | Latin Hypercube Designs with Branching and Nested Factors for Initialization of Automatic Algorithm Configuration. |
|---|---|
| Authors: | Wessing, Simon1, López-Ibáñez, Manuel2 |
| Source: | Evolutionary Computation. Spring2019, Vol. 27 Issue 1, p129-145. 17p. |
| Subjects: | Hypercube networks (Computer networks), Evolutionary computation, Metaheuristic algorithms, Monte Carlo method, Computers |
| 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 irace method is among the most widely used in the literature. By default, irace 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 irace , but also better than other initialization methods present in other automatic configuration methods. [ABSTRACT FROM AUTHOR] |
| Copyright of Evolutionary Computation is the property of MIT Press and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.) | |
| Database: | Engineering Source |
|
Full text is not displayed to guests.
Login for full access.
|
|
| 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 irace method is among the most widely used in the literature. By default, irace 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 irace , but also better than other initialization methods present in other automatic configuration methods. [ABSTRACT FROM AUTHOR] |
|---|---|
| ISSN: | 10636560 |
| DOI: | 10.1162/evco_a_00241 |
