Fluctuating crosstalk, deterministic noise, and GA scalability

This paper extends previous work showing how fluctuating crosstalk in a deterministic fitness function introduces noise into genetic algorithms. In that work, we modeled fluctuating crosstalk or nonlinear interactions among building blocks via higher-order Walsh coefficients. The fluctuating crosstalk behaved like exogenous noise and could be handled by increasing the population size and run duration. This behavior held until the strength of the crosstalk far exceeded the underlying fitness variance by a certain factor empirically observed. This paper extends that work by considering fluctuating crosstalk effects on genetic algorithm scalability using smaller-ordered Walsh coefficients on two extremes of building block scaling: uniformly-scaled and exponentially-scaled building blocks. Uniformly-scaled building blocks prove to be more sensitive to fluctuating crosstalk than do exponentially-scaled building blocks in terms of function evaluations and run duration but less sensitive to population sizing for large building-block interactions. Our results also have implications for the relative performance of building-block-wise mutation over crossover.

[1]  Ralph R. Martin,et al.  Reducing Epistasis in Combinatorial Problems by Expansive Coding , 1993, ICGA.

[2]  David E. Goldberg,et al.  The Design of Innovation: Lessons from and for Competent Genetic Algorithms , 2002 .

[3]  David E. Goldberg,et al.  The gambler''s ruin problem , 1997 .

[4]  David E. Goldberg,et al.  Finite Markov Chain Analysis of Genetic Algorithms , 1987, ICGA.

[5]  W. Rudnick Genetic algorithms and fitness variance with an application to the automated design of artificial neural networks , 1992 .

[6]  Heinz Mühlenbein,et al.  Schemata, Distributions and Graphical Models in Evolutionary Optimization , 1999, J. Heuristics.

[7]  David E. Goldberg,et al.  The Gambler's Ruin Problem, Genetic Algorithms, and the Sizing of Populations , 1999, Evolutionary Computation.

[8]  Kenneth A. De Jong,et al.  Are Genetic Algorithms Function Optimizers? , 1992, PPSN.

[9]  L. Darrell Whitley,et al.  Dynamic Representations and Escaping Local Optima: Improving Genetic Algorithms and Local Search , 2000, AAAI/IAAI.

[10]  Franz Rothlauf,et al.  Evaluation-Relaxation Schemes for Genetic and Evolutionary Algorithms , 2004 .

[11]  David E. Goldberg,et al.  Let's Get Ready to Rumble: Crossover Versus Mutation Head to Head , 2004, GECCO.

[12]  David E. Goldberg,et al.  A Survey of Optimization by Building and Using Probabilistic Models , 2002, Comput. Optim. Appl..

[13]  David E. Goldberg,et al.  Fluctuating Crosstalk as a Source of Deterministic Noise and Its Effects on GA Scalability , 2006, EvoWorkshops.

[14]  David E. Goldberg,et al.  Genetic Algorithms, Selection Schemes, and the Varying Effects of Noise , 1996, Evolutionary Computation.

[15]  Michael I. Jordan Graphical Models , 1998 .

[16]  Elena Marchiori,et al.  Applications of Evolutionary Computing: Evoworkshops 2003 , 2003 .

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

[18]  Yuval Davidor,et al.  Epistasis Variance: A Viewpoint on GA-Hardness , 1990, FOGA.

[19]  L. Darrell Whitley,et al.  Predicting Epistasis from Mathematical Models , 1999, Evolutionary Computation.