Efficient AutoML via combinational sampling

Nguyen, D.A.; Kononova, A.V.; Menzel, S.; Sendhoff, B.; Bäck T.H.W. (2021)

Article in monograph or in proceedings

Automated machine learning (AutoML) aims to automatically produce the best machine learning pipeline, i.e., a sequence of operators and their optimized hyperparameter settings, to maximize the performance of an arbitrary machine learning problem. Typically, AutoML based Bayesian optimization (BO) approaches convert the AutoML optimization problem into a Hyperparameter Optimization (HPO) problem, where the choice of algorithms is modeled as an additional categorical hyperparameter. In this way, algorithms and their local hyper-parameters are referred to as the same level. Consequently, this approach makes the resulting initial sampling less robust. In this study, we describe a first attempt to formulate the AutoML optimization problem as its nature instead of transfer it into a HPO problem. To take advantage of this paradigm, we propose a novel initial sampling approach to maximize the coverage of the AutoML search space to help BO construct a robust surrogate model. We experiment with 2 independent scenarios of AutoML with 2 operators and 6 operators over 117 benchmark datasets. Results of our experiments demonstrate that the performance of BO significantly improved by using our sampling approach.

• All authors: Nguyen, D.A.; Kononova, A.V.; Menzel, S.; Sendhoff, B.; Bäck T.H.W.
• Date: 2021
• Conference: IEEE Symposium Series on Computational Intelligence (SSCI 2021)
• Date: 2021-12-05 - 2021-12-07
• Location: Orlando, FL, United States of America
• Sponsorship: Horizon 2020(H2020)
• Grant number: 766186