Lower bounds on the run time of the Univariate Marginal Distribution Algorithm on OneMax

Martin S. Krejca, Carsten Witt*

*Corresponding author for this work

Research output: Contribution to journalJournal articleResearchpeer-review

313 Downloads (Pure)

Abstract

The Univariate Marginal Distribution Algorithm (UMDA) – a popular estimation-of-distribution algorithm – is studied from a run time perspective. On the classical OneMax benchmark function on bit strings of length n, a lower bound of Ω(λ+μn+nlogn), where μ and λ are algorithm-specific parameters, on its expected run time is proved. This is the first direct lower bound on the run time of UMDA. It is stronger than the bounds that follow from general black-box complexity theory and is matched by the run time of many evolutionary algorithms. The results are obtained through advanced analyses of the stochastic change of the frequencies of bit values maintained by the algorithm, including carefully designed potential functions. These techniques may prove useful in advancing the field of run time analysis for estimation-of-distribution algorithms in general.
Original languageEnglish
JournalTheoretical Computer Science
Volume832
Pages (from-to)143-165
ISSN0304-3975
DOIs
Publication statusPublished - 2020

Keywords

  • Estimation-of-distribution algorithm
  • Run time analysi
  • Lower bound

Fingerprint

Dive into the research topics of 'Lower bounds on the run time of the Univariate Marginal Distribution Algorithm on OneMax'. Together they form a unique fingerprint.

Cite this