Towards an Adaptive CMA-ES Configurator - Sorbonne Université Access content directly
Conference Papers Year : 2018

Towards an Adaptive CMA-ES Configurator


Recent work has shown that significant performance gains over state-of-the-art CMA-ES variants can be obtained by a recombination of their algorithmic modules. It seems plausible that further improvements can be realized by an adaptive selection of these configurations. We address this question by quantifying the potential performance gain of such an online algorithm selection approach. In particular, we study the advantage of structurally adaptive CMA-ES variants on the functions F1, F10, F15, and F20 of the BBOB test suite. Our research reveals that significant speedups might be possible for these functions. Quite notably, significant performance gains might already be possible by adapting the configuration only once. More precisely, we show that for the tested problems such a single configuration switch can result in performance gains of up to 22%. With such a significant indication for improvement potential, we hope that our results trigger an intensified discussion of online structural algorithm configuration for CMA-ES variants.
No file

Dates and versions

hal-01921060 , version 1 (13-11-2018)



Sander van Rijn, Carola Doerr, Thomas Back. Towards an Adaptive CMA-ES Configurator. Parallel Problem Solving from Nature – PPSN XV. PPSN 2018., Sep 2018, Coimbra, Portugal. pp.54-65, ⟨10.1007/978-3-319-99253-2_5⟩. ⟨hal-01921060⟩
77 View
0 Download



Gmail Facebook X LinkedIn More