Evaluation relaxation using substructural information and linear estimation

The paper presents an evaluation-relaxation scheme where a fitness surrogate automatically adapts to the problem structure and the partial contributions of subsolutions to the fitness of an individual are estimated efficiently and accurately. In particular, the probabilistic model built by extended compact genetic algorithm is used to infer the structural form of the surrogate and a least squares method is used to estimate the coefficients of the surrogate. Using the surrogate avoids the need for expensive fitness evaluation for some of the solutions, and thereby yields significant efficiency enhancement. Results show that a surrogate, which automatically adapts to problem knowledge mined from probabilistic models, yields substantial speedup (1.75--3.1) on a class of boundedly-difficult additively-decomposable problems with and without additive Gaussian noise. The speedup provided by the surrogate increases with the number of substructures, substructure complexity, and noise-to-signal ratio.

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

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

[3]  David E. Goldberg,et al.  Combining competent crossover and mutation operators: a probabilistic model building approach , 2005, GECCO '05.

[4]  Jorma Rissanen,et al.  Stochastic Complexity in Statistical Inquiry , 1989, World Scientific Series in Computer Science.

[5]  D. Bertsekas Incremental least squares methods and the extended Kalman filter , 1994, Proceedings of 1994 33rd IEEE Conference on Decision and Control.

[6]  Natalia Alexandrov,et al.  Multidisciplinary design optimization : state of the art , 1997 .

[7]  Yaochu Jin,et al.  A comprehensive survey of fitness approximation in evolutionary computation , 2005, Soft Comput..

[8]  J. Dennis,et al.  MANAGING APPROXIMATION MODELS IN OPTIMIZATION , 2007 .

[9]  Ali H. Sayed,et al.  Linear Estimation (Information and System Sciences Series) , 2000 .

[10]  N. Draper,et al.  Applied Regression Analysis. , 1967 .

[11]  Hussein A. Abbass,et al.  Sub-structural niching in estimation of distribution algorithms , 2005, GECCO '05.

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

[13]  Xavier Llorà,et al.  Combating user fatigue in iGAs: partial ordering, support vector machines, and synthetic fitness , 2005, GECCO '05.

[14]  Shalabh,et al.  Linear Models and Generalizations: Least Squares and Alternatives , 2007 .

[15]  John J. Grefenstette,et al.  Genetic Search with Approximate Function Evaluation , 1985, ICGA.

[16]  Kalyanmoy Deb,et al.  Sufficient conditions for deceptive and easy binary functions , 1994, Annals of Mathematics and Artificial Intelligence.

[17]  David E. Goldberg,et al.  Online population size adjusting using noise and substructural measurements , 2005, 2005 IEEE Congress on Evolutionary Computation.

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

[19]  G. Harik Linkage Learning via Probabilistic Modeling in the ECGA , 1999 .

[20]  Martin Pelikan,et al.  Fitness Inheritance in the Bayesian Optimization Algorithm , 2004, GECCO.

[21]  Robert E. Smith,et al.  Fitness inheritance in genetic algorithms , 1995, SAC '95.

[22]  J. -F. M. Barthelemy,et al.  Approximation concepts for optimum structural design — a review , 1993 .

[23]  Martin Pelikan,et al.  Hierarchical Bayesian optimization algorithm: toward a new generation of evolutionary algorithms , 2010, SICE 2003 Annual Conference (IEEE Cat. No.03TH8734).

[24]  Dale Borowiak,et al.  Linear Models, Least Squares and Alternatives , 2001, Technometrics.

[25]  Yaochu Jin,et al.  Managing approximate models in evolutionary aerodynamic design optimization , 2001, Proceedings of the 2001 Congress on Evolutionary Computation (IEEE Cat. No.01TH8546).

[26]  David E. Goldberg,et al.  Dependency Structure Matrix Analysis: Offline Utility of the Dependency Structure Matrix Genetic Algorithm , 2004, GECCO.

[27]  Pedro Larrañaga,et al.  Estimation of Distribution Algorithms , 2002, Genetic Algorithms and Evolutionary Computation.

[28]  David E. Goldberg,et al.  Designing Competent Mutation Operators Via Probabilistic Model Building of Neighborhoods , 2004, GECCO.

[29]  David E. Goldberg,et al.  Efficient Genetic Algorithms Using Discretization Scheduling , 2005, Evolutionary Computation.

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

[31]  David E. Goldberg,et al.  Efficiency enhancement of genetic algorithms via building-block-wise fitness estimation , 2004, Proceedings of the 2004 Congress on Evolutionary Computation (IEEE Cat. No.04TH8753).

[32]  S. Haykin,et al.  Adaptive Filter Theory , 1986 .

[33]  D. Goldberg,et al.  Don't evaluate, inherit , 2001 .

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