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, December 18, 2014, 12:15 pm

Duration: 30 minutes

Location: OAT S15/S16/S17

Speaker: Nick Spooner

Fixed-Budget Performance of the (1+1)-EA on Linear Functions

The theoretical analysis of randomised search heuristics for discrete optimization problems has typically focused on the question of expected running time, i.e. the number of steps required on average to reach an optimal solution. In their seminal paper, Jansen and Zarges introduce a different perspective: so-called `fixed budget' analysis. To measure the quality of an (evolutionary) algorithm on a specific problem, Jansen and Zarges ask two related, but not identical, questions. Firstly, given an predetermined number of iterations, or `budget', what is the quality of the best solution found within this budget (a priori)? Secondly, if the algorithm has spent budget $B$, then how does the quality of the best solution found improve when the algorithm is allowed to continue searching for an additional budget $\Delta B$ (a posteriori)? We present a fixed budget analysis of the (1+1) evolutionary algorithm for general linear functions, attempting to answer both a priori and a posteriori questions.

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

Previous talks by year:   2024  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