An exponential lower bound for the runtime of the compact genetic algorithm on jump functions - Archive ouverte HAL Access content directly
Conference Papers Year : 2019

An exponential lower bound for the runtime of the compact genetic algorithm on jump functions

Abstract

In the first runtime analysis of an estimation-of-distribution algorithm (EDA) on the multimodal jump function class, Hasenöhrl and Sutton (GECCO 2018) proved that the runtime of the compact genetic algorithm with suitable parameter choice on jump functions with high probability is at most polynomial (in the dimension) if the jump size is at most logarithmic (in the dimension), and is at most exponential in the jump size if the jump size is super-logarithmic. The exponential runtime guarantee was achieved with a hypothetical population size that is also exponential in the jump size. Consequently, this setting cannot lead to a better runtime. In this work, we show that any choice of the hypothetical population size leads to a runtime that, with high probability, is at least exponential in the jump size. This result might be the first non-trivial exponential lower bound for EDAs that holds for arbitrary parameter settings.
Fichier principal
Vignette du fichier
1904.08415.pdf (237.64 Ko) Télécharger le fichier
Origin : Publisher files allowed on an open archive

Dates and versions

hal-04484767 , version 1 (04-04-2024)

Identifiers

Cite

Benjamin Doerr. An exponential lower bound for the runtime of the compact genetic algorithm on jump functions. FOGA '19: Foundations of Genetic Algorithms XV, 2019, Potsdam Germany, France. pp.25-33, ⟨10.1145/3299904.3340304⟩. ⟨hal-04484767⟩
11 View
2 Download

Altmetric

Share

Gmail Facebook X LinkedIn More