Skip to Main content Skip to Navigation
Conference papers

QR mutations improve many evolution strategies -a lot on highly multimodal problems

Fabien Teytaud 1 Olivier Teytaud 2
2 TAO - Machine Learning and Optimisation
CNRS - Centre National de la Recherche Scientifique : UMR8623, Inria Saclay - Ile de France, UP11 - Université Paris-Sud - Paris 11, LRI - Laboratoire de Recherche en Informatique
Abstract : Previous studies have shown the efficiency of using quasi-random mutations on the well-know CMA evolution strategy [13]. Quasi-random mutations have many advantages, in particular their application is stable, efficient and easy to use. In this article, we extend this principle by applying quasi-random mutations on several well known continuous evolutionary algorithms (SA, CMSA, CMA) and do it on several old and new test functions, and with several criteria. The results point out a clear improvement compared to the baseline, in all cases, and in particular for moderate computational budget.
Document type :
Conference papers
Complete list of metadata

Cited literature [14 references]  Display  Hide  Download
Contributor : Fabien Teytaud <>
Submitted on : Thursday, December 1, 2016 - 4:56:43 PM
Last modification on : Tuesday, January 5, 2021 - 1:04:02 PM
Long-term archiving on: : Tuesday, March 21, 2017 - 9:22:42 AM


Files produced by the author(s)




Fabien Teytaud, Olivier Teytaud. QR mutations improve many evolution strategies -a lot on highly multimodal problems. ACM-GECCO'16, Jul 2016, Denver, United States. pp.35-36, ⟨10.1145/1235⟩. ⟨hal-01406727⟩



Record views


Files downloads