The analysis of randomized search heuristics on classes of functions is fundamental for the understanding of the underlying stochastic process and the development of suitable proof techniques. Recently, remarkable progress has been made in bounding the expected optimization time of the simple (1+1) EA on the class of linear functions. We improve the best known bound in this setting from (1.39+o(1))(en ln n) to (en ln n)+O(n) in expectation and with high probability, which is tight up to lower-order terms. Moreover, upper and lower bounds for arbitrary mutations probabilities p are derived, which imply expected polynomial optimization time as long as p=O((ln n)/n) and which are tight if p=c/n for a constant c. As a consequence, the standard mutation probability p=1/n is optimal for all linear functions, and the (1+1) EA is found to be an optimal mutation-based algorithm. Furthermore, the algorithm turns out to be surprisingly robust since large neighborhood explored by the mutation operator does not disrupt the search.
|Title of host publication||29th International Symposium on Theoretical Aspects of Computer Science (STACS 2012)|
|Editors||Christoph Dürr, Thomas Wilke|
|Number of pages||12|
|Publisher||Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, Germany|
|Publication status||Published - 2012|
|Event||29th International Symposium on Theoretical Aspects of Computer Science (STACS 2012) - Paris, France|
Duration: 29 Feb 2012 → 3 Mar 2012
|Conference||29th International Symposium on Theoretical Aspects of Computer Science (STACS 2012)|
|Period||29/02/2012 → 03/03/2012|
|Series||Leibniz International Proceedings in Informatics|
Bibliographical noteLicensed under Creative Commons License NC-ND.
- Randomized Search Heuristics
- Evolutionary Algorithms
- Linear Functions
- Running Time Analysis