The cGA optimizes jump functions with jump size up to (1/20)ln n in O(n log n) generations when the population parameter is chosen well, and needs exp(Ω(k)) generations for large jumps no matter the parameter.
The unrestricted black-box complexity of jump functions
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.NE 1years
2019 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
The Runtime of the Compact Genetic Algorithm on Jump Functions
The cGA optimizes jump functions with jump size up to (1/20)ln n in O(n log n) generations when the population parameter is chosen well, and needs exp(Ω(k)) generations for large jumps no matter the parameter.