Abstract
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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Auger, A., Hansen, N.: A restart CMA evolution strategy with increasing population size. In: 2005 IEEE Congress on Evolutionary Computation, vol. 2, pp. 1769–1776, September 2005. https://doi.org/10.1109/CEC.2005.1554902
Auger, A., Brockhoff, D., Hansen, N.: Mirrored sampling in evolution strategies with weighted recombination. In: Proceedings of the 13th Annual Conference on Genetic and Evolutionary Computation, GECCO 2011, pp. 861–868. ACM, New York (2011). https://doi.org/10.1145/2001576.2001694
Auger, A., Jebalia, M., Teytaud, O.: Algorithms (X, sigma, eta): quasi-random mutations for evolution strategies. In: Talbi, E.-G., Liardet, P., Collet, P., Lutton, E., Schoenauer, M. (eds.) EA 2005. LNCS, vol. 3871, pp. 296–307. Springer, Heidelberg (2006). https://doi.org/10.1007/11740698_26
Brockhoff, D., Auger, A., Hansen, N., Arnold, D.V., Hohm, T.: Mirrored sampling and sequential selection for evolution strategies. In: Schaefer, R., Cotta, C., Kołodziej, J., Rudolph, G. (eds.) PPSN 2010. LNCS, vol. 6238, pp. 11–21. Springer, Heidelberg (2010). https://doi.org/10.1007/978-3-642-15844-5_2
Hansen, N., Ostermeier, A.: Adapting arbitrary normal mutation distributions in evolution strategies: the covariance matrix adaptation. In: Proceedings of IEEE International Conference on Evolutionary Computation, pp. 312–317, May 1996. https://doi.org/10.1109/ICEC.1996.542381
Hansen, N.: CMA-ES with Two-Point Step-Size Adaptation. arXiv:0805.0231 [cs], May 2008
Hansen, N.: Benchmarking a BI-population CMA-ES on the BBOB-2009 function testbed. In: Proceedings of the 11th Annual Conference Companion on Genetic and Evolutionary Computation Conference: Late Breaking Papers, GECCO 2009, pp. 2389–2396. ACM, New York (2009). https://doi.org/10.1145/1570256.1570333, http://doi.acm.org/10.1145/1570256.1570333
Hansen, N., Auger, A., Brockhoff, D., Tuar, D., Tuar, T.: COCO: Performance Assessment. arXiv:1605.03560 [cs], May 2016
Hansen, N., Auger, A., Finck, S., Ros, R.: Real-parameter black-box optimization benchmarking 2009: experimental setup. Report, INRIA (2009). https://hal.inria.fr/inria-00362649/document
Jastrebski, G.A., Arnold, D.V.: Improving evolution strategies through active covariance matrix adaptation. In: 2006 IEEE International Conference on Evolutionary Computation, pp. 2814–2821 (2006). https://doi.org/10.1109/CEC.2006.1688662
Piad-Morffis, A., Estvez-Velarde, S., Boluf-Rhler, A., Montgomery, J., Chen, S.: Evolution strategies with thresheld convergence. In: 2015 IEEE Congress on Evolutionary Computation (CEC), pp. 2097–2104, May 2015. https://doi.org/10.1109/CEC.2015.7257143
van Rijn, S., Wang, H., van Leeuwen, M., Bäck, T.: Evolving the structure of evolution strategies. In: 2016 IEEE Symposium Series on Computational Intelligence (SSCI), pp. 1–8, December 2016. https://doi.org/10.1109/SSCI.2016.7850138
van Rijn, S., Wang, H., van Stein, B., Bäck, T.: Algorithm configuration data mining for CMA evolution strategies. In: Proceedings of the Genetic and Evolutionary Computation Conference, GECCO 2017, pp. 737–744. ACM, New York (2017). https://doi.org/10.1145/3071178.3071205, http://doi.acm.org/10.1145/3071178.3071205
Wang, H., Emmerich, M., Bäck, T.: Mirrored orthogonal sampling with pairwise selection in evolution strategies. In: Proceedings of the 29th Annual ACM Symposium on Applied Computing, SAC 2014, pp. 154–156. ACM, New York (2014). https://doi.org/10.1145/2554850.2555089, http://doi.acm.org/10.1145/2554850.2555089
Acknowledgements
The authors would like to thank Hao Wang for his participation in the discussions leading up to this work.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2018 Springer Nature Switzerland AG
About this paper
Cite this paper
van Rijn, S., Doerr, C., Bäck, T. (2018). Towards an Adaptive CMA-ES Configurator. In: Auger, A., Fonseca, C., Lourenço, N., Machado, P., Paquete, L., Whitley, D. (eds) Parallel Problem Solving from Nature – PPSN XV. PPSN 2018. Lecture Notes in Computer Science(), vol 11101. Springer, Cham. https://doi.org/10.1007/978-3-319-99253-2_5
Download citation
DOI: https://doi.org/10.1007/978-3-319-99253-2_5
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-99252-5
Online ISBN: 978-3-319-99253-2
eBook Packages: Computer ScienceComputer Science (R0)