Every Niching Method has its Niche: Fitness Sharing and Implicit Sharing Compared

Various extensions to the Genetic Algorithm (GA) attempt to find all or most optima in a search space containing several optima. Many of these emulate natural speciation. For co-evolutionary learning to succeed in a range of management and control problems, such as learning game strategies, such methods must find all or most optima. However, suitable comparison studies are rare. We compare two similar GA speciation methods, fitness sharing and implicit sharing. Using a realistic letter classification problem, we find they have advantages under different circumstances. Implicit sharing covers optima more comprehensively, when the population is large enough for a species to form at each optimum. With a population not large enough to do this, fitness sharing can find the optima with larger basins of attraction, and ignore the peaks with narrow bases, while implicit sharing is more easily distracted. This indicates that for a speciated GA trying to find as many near-global optima as possible, implicit sharing works well only if the population is large enough. This requires prior knowledge of how many peaks exist.

[1]  Temple F. Smith Occam's razor , 1980, Nature.

[2]  David E. Goldberg,et al.  Genetic Algorithms in Search Optimization and Machine Learning , 1988 .

[3]  Kalyanmoy Deb,et al.  An Investigation of Niche and Species Formation in Genetic Function Optimization , 1989, ICGA.

[4]  Tyler C. Folsom,et al.  A modular hierarchical neural network for machine vision , 1990, 1990 IJCNN International Joint Conference on Neural Networks.

[5]  Larry J. Eshelman,et al.  Preventing Premature Convergence in Genetic Algorithms by Preventing Incest , 1991, ICGA.

[6]  P. W. Frey,et al.  Letter recognition using Holland-style adaptive classifiers , 2004, Machine Learning.

[7]  Kalyanmoy Deb,et al.  Massive Multimodality, Deception, and Genetic Algorithms , 1992, PPSN.

[8]  Alan S. Perelson,et al.  Searching for Diverse, Cooperative Populations with Genetic Algorithms , 1993, Evolutionary Computation.

[9]  Ralph R. Martin,et al.  A Sequential Niche Technique for Multimodal Function Optimization , 1993, Evolutionary Computation.

[10]  Alan S. Perelson,et al.  Using Genetic Algorithms to Explore Pattern Recognition in the Immune System , 1993, Evolutionary Computation.

[11]  R. W. King,et al.  A continuous HMM based preprocessor for modular speech recognition neural networks , 1994, ICSLP.

[12]  Marc M. Van Hulle,et al.  The EDANN concept: A Modular Artificial Neural Network model for biological vision and image processing , 1994 .

[13]  Craig W. Reynolds Competition, Coevolution and the Game of Tag , 1994 .

[14]  Samir W. Mahfoud Genetic drift in sharing methods , 1994, Proceedings of the First IEEE Conference on Evolutionary Computation. IEEE World Congress on Computational Intelligence.

[15]  David J. Spiegelhalter,et al.  Machine Learning, Neural and Statistical Classification , 2009 .

[16]  Xin Yao,et al.  On Evolving Robust Strategies for Iterated Prisoner's Dilemma , 1993, Evo Workshops.

[17]  S. Ronald Finding multiple solutions with an evolutionary algorithm , 1995, Proceedings of 1995 IEEE International Conference on Evolutionary Computation.

[18]  Robert G. Reynolds,et al.  Racial Harmony and Function Optimization in Genetic Algorithms - the Races Genetic Algorithm , 1995 .

[19]  Samir W. Mahfoud A Comparison of Parallel and Sequential Niching Methods , 1995, ICGA.

[20]  Richard K. Belew,et al.  Methods for Competitive Co-Evolution: Finding Opponents Worth Beating , 1995, ICGA.

[21]  Xin Yao,et al.  A dilemma for fitness sharing with a scaling function , 1995, Proceedings of 1995 IEEE International Conference on Evolutionary Computation.

[22]  Alain Pétrowski,et al.  A clearing procedure as a niching method for genetic algorithms , 1996, Proceedings of IEEE International Conference on Evolutionary Computation.

[23]  Samir W. Mahfoud Niching methods for genetic algorithms , 1996 .

[24]  Xin Yao,et al.  Automatic modularization by speciation , 1996, Proceedings of IEEE International Conference on Evolutionary Computation.

[25]  William M. Spears,et al.  Simple Subpopulation Schemes , 1998 .