Carsten Witt

Update Strength in EDAs and ACO

2016

We provide a rigorous runtime analysis concerning the update strength, a vital parameter in probabilistic model-building GAs such as the step size 1/K in the compact Genetic Algorithm (cGA) and the evaporation factor ρ in …

Upper bounds on the runtime of the univariate marginal distribution algorithm on onemax

2017 · Proceedings of the Genetic and Evolutionary Computation Conference

A runtime analysis of the Univariate Marginal Distribution Algorithm (UMDA) is presented on the OneMax function for wide ranges of the parameters μ and λ. If μ ≥ c log n for some constant c …

Theory of Estimation-of-Distribution Algorithms

2018 · arXiv (Cornell University)

Estimation-of-distribution algorithms (EDAs) are general metaheuristics used in optimization that represent a more recent alternative to classical approaches like evolutionary algorithms. In a nutshell, EDAs typically do not directly evolve populations of search points but …