Abstract
NeuroEvolution of Augmenting Topologies (NEAT) is a system for evolving neural network topologies along with weights that has proven highly effective and adaptable for solving challenging reinforcement learning tasks. This paper analyses NEAT through the lens of Search Trajectory Networks (STNs), a recently proposed visual approach to study the dynamics of evolutionary algorithms. Our goal is to improve the understanding of neuroevolution systems. We present a visual and statistical analysis contrasting the behaviour of NEAT, with and without using the crossover operator, when solving the two benchmark problems outlined in the original NEAT article: XOR and double-pole balancing. Contrary to what is reported in the original NEAT article, our experiments without crossover perform significantly better in both domains.
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
References
Angeline, P.J., Saunders, G.M., Pollack, J.B.: An evolutionary algorithm that constructs recurrent neural networks. IEEE Trans. Neural Netw. 5(1), 54–65 (1994)
Csardi, G., Nepusz, T.: The igraph software package for complex network research. InterJ. Complex Syst. 1695, 1–9 (2006)
Dinh, H., Aubert, N., Noman, N., Fujii, T., Rondelez, Y., Iba, H.: An effective method for evolving reaction networks in synthetic biochemical systems. IEEE Trans. Evol. Comput. 19(3), 374–386 (2015)
Hastings, E., Guha, R., Stanley, K.: Automatic content generation in the galactic arms race video game. IEEE Trans. Comput. Intell. AI Games 1(4), 245–263 (2009)
Hoover, A., Stanley, K.: Exploiting functional relationships in musical composition. Connect. Sci. 21(2–3), 227–251 (2009)
McIntyre, A., Kallada, M., Miguel, C.G., da Silva, C.F.: NEAT-Python. https://github.com/CodeReclaimers/neat-python
Nadkarni, J., Ferreira Neves, R.: Combining neuroevolution and principal component analysis to trade in the financial markets. Expert Syst. Appl. 103, 184–195 (2018)
Newman, M.E.J.: Networks: An Introduction. Oxford University Press, Oxford; New York (2010)
Ochoa, G., Malan, K.M., Blum, C.: Search trajectory networks of population-based algorithms in continuous spaces. In: Castillo, P.A., Jiménez Laredo, J.L., Fernández de Vega, F. (eds.) EvoApplications 2020. LNCS, vol. 12104, pp. 70–85. Springer, Cham (2020). https://doi.org/10.1007/978-3-030-43722-0_5
Omelianenko, I.: Hands-On Neuroevolution with Python. Packt Publishing, Limited (2019)
Reingold, E.M., Tilford, J.S.: Tidier drawings of trees. IEEE Trans. Softw. Eng. SE-7(2), 223–228 (1981)
Stanley, K.O., Miikkulainen, R.: Evolving neural networks through augmenting topologies. Evol. Comput. 10(2), 99–127 (2002)
Stanley, K., Bryant, B., Miikkulainen, R.: Real-time neuroevolution in the NERO video game. IEEE Trans. Evol. Comput. 9(6), 653–668 (2005)
Wang, G., Cheng, G., Carr, T.: The application of improved neuroevolution of augmenting topologies neural network in marcellus shale lithofacies prediction. Comput. Geosci. 54, 50–65 (2013)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2021 Springer Nature Switzerland AG
About this paper
Cite this paper
Sarti, S., Ochoa, G. (2021). A NEAT Visualisation of Neuroevolution Trajectories. In: Castillo, P.A., Jiménez Laredo, J.L. (eds) Applications of Evolutionary Computation. EvoApplications 2021. Lecture Notes in Computer Science(), vol 12694. Springer, Cham. https://doi.org/10.1007/978-3-030-72699-7_45
Download citation
DOI: https://doi.org/10.1007/978-3-030-72699-7_45
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-72698-0
Online ISBN: 978-3-030-72699-7
eBook Packages: Computer ScienceComputer Science (R0)