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

  • Dmitry Vinokurov
  • , Maxim Buzdalov
  • , Arina Buzdalova
  • , Benjamin Doerr
  • , Carola Doerr

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

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.

Original languageEnglish
Title of host publicationGECCO 2019 Companion - Proceedings of the 2019 Genetic and Evolutionary Computation Conference Companion
PublisherAssociation for Computing Machinery, Inc
Pages2068-2071
Number of pages4
ISBN (Electronic)9781450367486
DOIs
Publication statusPublished - 13 Jul 2019
Event2019 Genetic and Evolutionary Computation Conference, GECCO 2019 - Prague, Czech Republic
Duration: 13 Jul 201917 Jul 2019

Publication series

NameGECCO 2019 Companion - Proceedings of the 2019 Genetic and Evolutionary Computation Conference Companion

Conference

Conference2019 Genetic and Evolutionary Computation Conference, GECCO 2019
Country/TerritoryCzech Republic
CityPrague
Period13/07/1917/07/19

Keywords

  • Drift analysis
  • Fixed-target analysis
  • Resampling
  • Runtime analysis

Fingerprint

Dive into the research topics of 'Fixed-target runtime analysis of the (1 + 1) EA with resampling'. Together they form a unique fingerprint.

Cite this