Fixed-target runtime analysis of the (1 + 1) EA with resampling (student workshop paper)

Abstract : We conduct a fixed-target runtime analysis of (1 + 1) EA with resampling on the OneMax and BinVal problems. For OneMax, our fixed-target upper bound refines the previously known bound. Our fixed-target lower bound for OneMax is the first of this kind. We also consider linear functions and show that the traditional approaches via drift analysis cannot easily be extended to yield fixed-target results. However, for the particular case of BinVal, a relatively precise fixed-target bound is obtained.
Document type :
Conference papers
Complete list of metadatas

Cited literature [11 references]  Display  Hide  Download

https://hal.sorbonne-universite.fr/hal-02179611
Contributor : Carola Doerr <>
Submitted on : Tuesday, January 14, 2020 - 3:50:28 PM
Last modification on : Saturday, February 1, 2020 - 1:52:32 AM

File

bl swksp113s2-file1 (1).pdf
Files produced by the author(s)

Identifiers

Citation

Dmitry Vinokurov, Maxim Buzdalov, Arina Buzdalov, Benjamin Doerr, Carola Doerr. Fixed-target runtime analysis of the (1 + 1) EA with resampling (student workshop paper). Genetic and Evolutionary Computation Conference, Companion Material, Jul 2019, Prague, Czech Republic. pp.2068-2071, ⟨10.1145/3319619.3326906⟩. ⟨hal-02179611⟩

Share

Metrics

Record views

57

Files downloads

27