Unbiased Black Box Search Algorithms

Jonathan Rowe, MD Vose

Research output: Chapter in Book/Report/Conference proceedingConference contribution

28 Citations (Scopus)


We formalize the concept of an unbiased black box algorithm, which generalises the idea previously introduced by Lehre and Witt. Our formalization of bias relates to the symmetry group of the problem class under consideration, establishing a connection with previous work on No Free Lunch. Our definition is motivated and justified by a series of results, including the outcome that given a biased algorithm, there exists a corresponding unbiased algorithm with the same expected behaviour (over the problem class) and equal or better worst-case performance. For the case of evolutionary algorithms, it is already known how to construct unbiased mutation and crossover operators, and we summarise those results.
Original languageEnglish
Title of host publicationGECCO '11 Proceedings of the 13th annual conference on Genetic and evolutionary computation
PublisherAssociation for Computing Machinery
Number of pages8
ISBN (Print)978-1-4503-0557-0
Publication statusPublished - 16 Jul 2011
EventAnnual Conference on Genetic and Evolutionary Computation (GECCO '11), 13th - New York, United States
Duration: 16 Jul 2011 → …


ConferenceAnnual Conference on Genetic and Evolutionary Computation (GECCO '11), 13th
Country/TerritoryUnited States
CityNew York
Period16/07/11 → …


Dive into the research topics of 'Unbiased Black Box Search Algorithms'. Together they form a unique fingerprint.

Cite this