Department of Computer Science | Institute of Theoretical Computer Science | CADMO

Theory of Combinatorial Algorithms

Prof. Emo Welzl and Prof. Bernd Gärtner

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

Mittagsseminar Talk Information

Date and Time: Thursday, September 23, 2021, 12:15 pm

Duration: 30 minutes

Location: CAB G51 and Zoom: conference room

Speaker: Johannes Lengler

Evolutionary Algorithms in Dynamic Environments

Evolutionary Algorithms (EAs) are simple optimization heuristics. They maintain a population of solutions, and evolve this population over time. EAs are particularly useful when no gradients of the objective/loss/fitness function are available, and when the objective function does not have exploitable structures, like being quadratic or convex.

I will present results on the behaviour of EAs in dynamic environments. In dynamic linear functions, the objective value of a bit string x is \sum W_i x_i, where the W_i are positive weights that are i.i.d. redrawn periodically. Surprisingly, the performance of EAs can deteriorate dramatically in such situations. In particular, they may need exponential time (in the dimension) to find the optimum. Our main objective is to understand when exactly this slowdown happens. The answer is rather complex, and involves some surprising interaction between population size, mutation strength, and the speed of environmental changes. Our understanding is only partially, and I will sketch some known results.

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