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: Tuesday, November 20, 2012, 12:15 pm

Duration: 30 minutes

Location: OAT S15/S16/S17

Speaker: Johannes Lengler

Black Box Complexities

A function f on a finite state space is to be maximized. For such tasks, people often use Randomized Search Heuristics (RSHs). While these give simple algorithms and often yield good results in practice, the theory of RSHs is shamefully underdeveloped. The problem is that we lack definitions of what "good results in practice" are.

One approach is to compare the runtime of RSHs on a given problem with its "unrestricted Black Box Complexity", i.e., with the minimal expected number of evaluations of f that any algorithm needs. Unfortunately, this complexity turns out to be too small to be useful for many standard problems.

For this reason, several variations of the concept "Black Box Complexity" have been proposed. I will introduce the three main variants: "ranking-based Black Box Complexity", "unbiased Black Box Complexity" and "memory-restricted Black Box Complexity", and discuss their advantages and weaknesses.

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