Sufficient conditions for deceptive and easy binary functions

This paper finds sufficient conditions for fully or partially deceptive binary functions by calculating schema average fitness values. Deception conditions are first derived for functions of unitation (functions that depend only on the number of 1s in the string) and then extended for any binary function. The analysis is also extended to find a set of sufficient conditions for fully easy binary functions. It is found that the computational effort required to investigate full or partial deception in a problem of sizel using these sufficient conditions isO(2l) and using all necessary conditions of deception isO(4l). This calculation suggests that these sufficient conditions can be used to quickly test deception in a function. Furthermore, it is found that these conditions may also be systematically used to design a fully deceptive function by performing onlyO(l2) comparisons and to design a partially deceptive function to orderk by performing onlyO(kl) comparisons. The analysis shows that in the class of functions of unitation satisfying these conditions of deception, an order-k partially deceptive function is also partially deceptive to any lower order. Finally, these sufficient conditions are used to investigate deception in a number of currently-used deceptive problems.

[1]  David E. Goldberg,et al.  Genetic Algorithms and Walsh Functions: Part I, A Gentle Introduction , 1989, Complex Syst..

[2]  D. E. Goldberg,et al.  Simple Genetic Algorithms and the Minimal, Deceptive Problem , 1987 .

[3]  David E. Goldberg,et al.  Genetic Algorithms and Walsh Functions: Part II, Deception and Its Analysis , 1989, Complex Syst..

[4]  Andrew J. Mason,et al.  Partition Coefficients, Static Deception and Deceptive Problems for Non-Binary Alphabets , 1991, ICGA.

[5]  Kalyanmoy Deb,et al.  Don't Worry, Be Messy , 1991, ICGA.

[6]  Kalyanmoy Deb,et al.  Messy Genetic Algorithms: Motivation, Analysis, and First Results , 1989, Complex Syst..

[7]  Stewart W. Wilson.  GA-Easy Does Not Imply Steepest-Ascent Optimizable , 1991, ICGA.

[8]  Kalyanmoy Deb,et al.  Messy Genetic Algorithms Revisited: Studies in Mixed Size and Scale , 1990, Complex Syst..

[9]  GUNAR E. LIEPINS,et al.  Representational issues in genetic optimization , 1990, J. Exp. Theor. Artif. Intell..

[10]  Kalyanmoy Deb,et al.  Analyzing Deception in Trap Functions , 1992, FOGA.

[11]  Lawrence Davis,et al.  Bit-Climbing, Representational Bias, and Test Suite Design , 1991, ICGA.

[12]  John J. Grefenstette,et al.  Deception Considered Harmful , 1992, FOGA.

[13]  Abdollah Homaifar,et al.  Analysis and Design of a General GA Deceptive Problem , 1991, International Conference on Genetic Algorithms.

[14]  Gunar E. Liepins,et al.  Schema Disruption , 1991, ICGA.

[15]  David E. Goldberg,et al.  Construction of high-order deceptive functions using low-order Walsh coefficients , 1992, Annals of Mathematics and Artificial Intelligence.

[16]  Kalyanmoy Deb,et al.  Genetic Algorithms, Noise, and the Sizing of Populations , 1992, Complex Syst..

[17]  D. Ackley.  A connectionist machine for genetic hillclimbing , 1987 .

[18]  K. Deb.  Binary and floating-point function optimization using messy genetic algorithms , 1991 .

[19]  Kenneth Alan De Jong,et al.  An analysis of the behavior of a class of genetic adaptive systems. , 1975 .

[20]  David E. Goldberg,et al.  Genetic Algorithms and the Variance of Fitness , 1991, Complex Syst..

[21]  L. Darrell Whitley,et al.  Fundamental Principles of Deception in Genetic Search , 1990, FOGA.