Hybridizing the 1/5-th success rule with q-learning for controlling the mutation rate of an evolutionary algorithm

1Citations
Citations of this article
4Readers
Mendeley users who have this article in their library.
Get full text

Abstract

It is well known that evolutionary algorithms (EAs) achieve peak performance only when their parameters are suitably tuned to the given problem. Even more, it is known that the best parameter values can change during the optimization process. Parameter control mechanisms are techniques developed to identify and to track these values. Recently, a series of rigorous theoretical works confirmed the superiority of several parameter control techniques over EAs with best possible static parameters. Among these results are examples for controlling the mutation rate of the $$(1+\lambda )$$ EA when optimizing the OneMax problem. However, it was shown in [Rodionova et al., GECCO’19] that the quality of these techniques strongly depends on the offspring population size $$\lambda $$. We introduce in this work a new hybrid parameter control technique, which combines the well-known one-fifth success rule with Q-learning. We demonstrate that our HQL mechanism achieves equal or superior performance to all techniques tested in [Rodionova et al., GECCO’19] and this – in contrast to previous parameter control methods – simultaneously for all offspring population sizes $$\lambda $$. We also show that the promising performance of HQL is not restricted to OneMax, but extends to several other benchmark problems.

Cite

CITATION STYLE

APA

Buzdalova, A., Doerr, C., & Rodionova, A. (2020). Hybridizing the 1/5-th success rule with q-learning for controlling the mutation rate of an evolutionary algorithm. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 12270 LNCS, pp. 485–499). Springer Science and Business Media Deutschland GmbH. https://doi.org/10.1007/978-3-030-58115-2_34

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free