Abstract
In this paper, we focus on the learning aspect of NEAT and its variants in an attempt to solve benchmark problems through fewer generations. In NEAT, genetic algorithm is the key technique that is used to complexify artificial neural network. Crossover value, being the parameter that dictates the evolution of NEAT is reduced. Reducing crossover rate aids in allowing the algorithm to learn. This is because lesser interchange among genes ensures that patterns of genes carrying valuable information is not split or strayed during mating of two chromosomes. By tweaking the crossover parameter and with some minor modification, it is shown that the performance of NEAT can be improved. This enables NEAT algorithm to evolve slowly and retain information even while undergoing complexification. Thus, the learning process in NEAT is greatly enhanced as compared to evolution.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Stanley, K.O., Miikkulainen, R.: Efficient Evolution of Neural Network Topologies. In: Proceedings of the 2002 Congress on Evolutionary Computation (CEC 2002), Honolulu, Hawaii (2002)
Gomez, F., Miikkulainen, R.: Solving non-Markovian control tasks with neuroevolution. In: Proceedings of the 16th International Joint Conference on Artificial Intelligence. Morgan Kaufmann, Denver (1999)
Moriarty, D.E.: Symbiotic Evolution of Neural Networks in Sequential Decision Tasks. PhD thesis, Department of Computer Sciences, The University of Texas at Austin, Technical Report UT-AI97-257 (1997)
Zheng, Z.: A benchmark for classifier learning. Technical Report TR474, Basser Department of Computer Science, University of Sydney, N.S.W. Australia (2006), Anonymous ftp from ftp.cs.su.oz.au.in/pub/tr
Granville, V., Krivanek, M., Rasson, J.P.: Simulated annealing: A proof of convergence. IEEE Transactions on Pattern Analysis and Machine Intelligence 16(6), 652–656 (1994)
Cano, A., Gomez, M., Moral, S.: Application of a hill-climbing algorithm to exact and approximate inference in credal networks. In: 4th International Symposium on Imprecise Probabilities and Their Applications, Pittsburgh, Pennsylvania (2005)
Stanley, K.O.: Exploiting Regularity without Development. In: Proceedings of the 2006 AAAI Fall Symposium on Developmental Systems. AAAI Press, Menlo Park (2006)
Stanley, K.O., Miikkulainen, R.: Competitive coevolution through evolutionary complexification. Journal of Artificial Intelligence Research 21, 63–100 (2004)
Whiteson, S., Stanley, K.O., Miikkulainen, R.: Automatic Feature Selection in Neuroevolution. In: Proceedings of the Genetic and Evolutionary Computation Conference Workshop on Self-Organization (GECCO 2004), Seattle, WA (2004)
http://amazingdiscoveries.org/Cdeception_gene_chromosome_sexual_reproduction.hmtl (accessed December 17, 2011)
Moriarty, D.E., Miikkulainen, R.: Efficient reinforcement learning through symbiotic evolution. Machine Learning 22, 11–32 (1996)
Baird, L.C.: Residual Algorithms: Reinforcement Learning with Function Approximation. In: Prieditis, A., Russell, S. (eds.) Proceedings of the Twelfth International Conference on Machine Learning, July 9-12 (1995)
Sutton, R.S., Barto, A.G.: Reinforcement Learning: An Introduction. MIT Press, Cambridge (1998)
http://www.cs.utexas.edu/users/ai-lab/?neatmatlab (accessed on October 25, 2010)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer International Publishing Switzerland
About this paper
Cite this paper
Mohabeer, H., Soyjaudah, K.M.S. (2013). Improving the Performance of NEAT Related Algorithm via Complexity Reduction in Search Space. In: Omatu, S., Neves, J., Rodriguez, J., Paz Santana, J., Gonzalez, S. (eds) Distributed Computing and Artificial Intelligence. Advances in Intelligent Systems and Computing, vol 217. Springer, Cham. https://doi.org/10.1007/978-3-319-00551-5_1
Download citation
DOI: https://doi.org/10.1007/978-3-319-00551-5_1
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-00550-8
Online ISBN: 978-3-319-00551-5
eBook Packages: EngineeringEngineering (R0)