Comparison between Lamarckian Evolution and Baldwin Evolution of neural network

• Main Authors: Taha, Imad, Inazy, Qabas
• Format: Article
• Language: English
• Published: Al Rafidain University College 2006
• Subjects: QA75 Electronic computers. Computer science
• Online Access: http://irep.iium.edu.my/6683/1/imad-qabas.pdf; http://irep.iium.edu.my/6683/; http://www.coalrafidain.edu.iq

Genetic Algorithms are very efficient at exploring the entire search space; however, they are relatively poor at finding the precise local optimal solution in the region at which the algorithm converges. Hybrid genetic algorithms are the combination of learning algorithms(Back propagation), usually working as evaluation functions, and genetic algorithms. There are two basic strategies in using hybrid GAs, Lamarckian and Baldwinian evolution. Traditional schema theory does not support Lamatckian learning, i.e, forcing the genetic representation to match the solution found by the learning algorithm. However, Lamarckian learning does alleviate the problem of multiple genotypes mapping to the same phenotype. Baldwinian learning uses learning algorithm to change the fitness landscape, but the solution that is found is not encoded back into genetic string. We presented hybrid genetic algorithm for optimizing weights as well as the topology of artificial neural networks, by introducing the concepts of Lamarckian and Baldwin evolution effects. Experimental results with extensive set of experiments show that the hybrid GA exploiting the Baldwin effect more effect than Lamarckian evolution but is slow in convergence, and the results of proposed algorithms outperform those of previous algorithms.