Information landscapes and the analysis of search algorithms

In [15] we introduced the information landscape as a new concept of a landscape. We showed that for a landscape of a small size, information landscape theory can be used to predict the performance of a GA without running the algorithm. Based on this framework, here we develop a new theoretical model to study search algorithms in general. Particularly, we are able to infer important properties of a search algorithm without having knowledge about its specific operators. We give an example of this technique for a simple GA. Categories and Subject Descriptors F.2.0 [Theory of Computation]: Analysis of algorithms and problem complexity. General Terms Algorithms, Performance, Theory. Keywords Fitness landscape, Genetic Algorithm, Theory

• Type: Conference
• Year: 2005
• Where: GECCO
• Authors: Yossi Borenstein, Riccardo Poli
• Keywords: GECCO 2005, Information Landscape, Information Landscape Theory, Search Algorithm