Mittagsseminar (in cooperation with A. Steger, D. Steurer and B. Sudakov)

Date and Time: Tuesday, March 14, 2023, 12:15 pm

Duration: 30 minutes

Location: CAB G51

Speaker: Duri Janett

Tight Runtime Bounds for Static Unary Unbiased Evolutionary Algorithms on Linear Functions

In this talk, we investigate static unary unbiased Evolutionary Algorithms (EAs). Such EAs can only generate offspring by mutation, i.e., from a single parent. Examples of unary unbiased mutation operators include randomized local search, standard bit mutation, and fast mutation. Unary unbiased mutation operators are uniquely described by a probability distribution on the set of possible search radii. We show that, up to lower order terms, the runtime of the (1 + 1)-EA equipped with an (almost) arbitrary but static unary unbiased mutation operator on linear functions is 1/p₁ · n ln n, where p₁ is the probability that the algorithm searches with radius 1 in a given iteration. This generalizes a seminal result of Witt [CPC ’13], where he showed that this holds for the (1 + 1)-EA using standard bit mutation with a constant mutation rate.

Upcoming talks     |     All previous talks     |     Talks by speaker     |     Upcoming talks in iCal format (beta version!)

Previous talks by year:   2023  2022  2021  2020  2019  2018  2017  2016  2015  2014  2013  2012  2011  2010  2009  2008  2007  2006  2005  2004  2003  2002  2001  2000  1999  1998  1997  1996  

Information for students and suggested topics for student talks

Automatic MiSe System Software Version 1.4803M   |   admin login