DocumentCode
2663001
Title
Case studies in applying fitness distributions in evolutionary algorithms. II. Comparing the improvements from crossover and Gaussian mutation on simple neural networks
Author
Jain, Ankit ; Fogel, David B.
Author_Institution
Netaji Subhas Inst. Technol., New Delhi, India
fYear
2000
fDate
2000
Firstpage
91
Lastpage
97
Abstract
Previous efforts in applying fitness distributions of Gaussian mutation for optimizing simple neural networks in the XOR problem are extended by conducting a similar analysis for three types of crossover operators. One-point, two-point and uniform crossover are applied to the best-evolved neural networks at each generation in an evolutionary trial. The maximum expected improvement under Gaussian mutation with a single fixed standard deviation is then compared to that which can be obtained using crossover. The results indicate that the benefits of each type of crossover varies as a function of the generation number. Furthermore, these fitness profiles are notably similar (i.e., there is little functional difference between the various crossover operators). This does not support a building block hypothesis for explaining the gains that can be made via recombination. The results indicate cases where mutation alone can outperform recombination and vice versa
Keywords
evolutionary computation; neural nets; Gaussian mutation; XOR problem; crossover; evolutionary algorithms; fitness distributions; mutation; neural networks; optimization; recombination; Blades; Computer aided software engineering; Difference equations; Evolutionary computation; Genetic mutations; Intelligent networks; Neural networks; State-space methods; Stochastic processes; USA Councils;
fLanguage
English
Publisher
ieee
Conference_Titel
Combinations of Evolutionary Computation and Neural Networks, 2000 IEEE Symposium on
Conference_Location
San Antonio, TX
Print_ISBN
0-7803-6572-0
Type
conf
DOI
10.1109/ECNN.2000.886224
Filename
886224
Link To Document