Black-box mixed-variable optimisation using a surrogate model that satisfies integer constraints

Conference Paper (2021)
Author(s)

L. Bliek (Eindhoven University of Technology)

A. Guijt (Centrum Wiskunde & Informatica (CWI))

SE Verwer (TU Delft - Cyber Security)

Mathijs De Weerdt (TU Delft - Algorithmics)

Research Group
Cyber Security
Copyright
© 2021 L. Bliek, A. Guijt, S.E. Verwer, M.M. de Weerdt
DOI related publication
https://doi.org/10.1145/3449726.3463136
More Info
expand_more
Publication Year
2021
Language
English
Copyright
© 2021 L. Bliek, A. Guijt, S.E. Verwer, M.M. de Weerdt
Research Group
Cyber Security
Pages (from-to)
1851-1859
ISBN (electronic)
9781450383516
Reuse Rights

Other than for strictly personal use, it is not permitted to download, forward or distribute the text or part of it, without the consent of the author(s) and/or copyright holder(s), unless the work is under an open content license such as Creative Commons.

Abstract

A challenging problem in both engineering and computer science is that of minimising a function for which we have no mathematical formulation available, that is expensive to evaluate, and that contains continuous and integer variables, for example in automatic algorithm configuration. Surrogate-based algorithms are very suitable for this type of problem, but most existing techniques are designed with only continuous or only discrete variables in mind. Mixed-Variable ReLU-based Surrogate Modelling (MVRSM) is a surrogate-based algorithm that uses a linear combination of rectified linear units, defined in such a way that (local) optima satisfy the integer constraints. Unlike other methods, it also has a constant run-time per iteration. This method outperforms the state of the art on several synthetic benchmarks with up to 238 continuous and integer variables, and achieves competitive performance on two real-life benchmarks: XG-Boost hyperparameter tuning and Electrostatic Precipitator optimisation.