Abstract
Neurocontroller minimization is beneficial for constructing small parsimonious networks that permit a better understanding of their workings. This paper presents a novel, Evolutionary Network Minimization (ENM) algorithm which is applied to fully recurrent neurocontrollers. ENM is a simple, standard genetic algorithm with an additional step in which small weights are irreversibly eliminated. ENM has a unique combination of features which distinguish it from previous evolutionary minimization algorithms: 1. An explicit penalty term is not added to the fitness function. 2. Minimization begins after functional neurocontrollers have been successfully evolved. 3. Successful minimization relies solely on the workings of a drift that removes unimportant weights and, importantly, on continuing adaptive modifications of the magnitudes of the remaining weights. Our results testify that ENM is successful in extensively minimizing recurrent evolved neurocontrollers while keeping their fitness intact and maintaining their principal functional characteristics.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Reed, R.: Pruning algorithms – a survey. IEEE Transactions on Neural Networks 4, 740–747 (1993)
Lecun, Y., Denker, J., Solla, S., Howard, R.E., Jackel, L.D.: Optimal brain damage. In: Touretzky, D.S. (ed.) Advances in Neural Information Processing Systems, San Mateo, CA, vol. 2, pp. 598–605. Morgan Kauffman, San Francisco (1990)
Hassibi, B., Stork, D.G.: Second order derivatives for network pruning: Optimal brain surgeon. In: Hanson, S.J., Cowan, J.D., Giles, C.L. (eds.) Advances in Neural Information Processing Systems, San Mateo, CA, vol. 5, pp. 164–171. Morgan Kaufmann, San Francisco (1993)
Aharonov, R., Segev, L., Meilijson, I., Ruppin, E.: Localization of function via lesion analysis. Neural Computation 15, 885–913 (2003)
Keinan, A., Hilgetag, C.C., Meilijson, I., Ruppin, E.: Fair attribution of functional contribution in artificial and biological networks (2003) (submitted)
Zhang, B.T., Mühlenbein, H.: Genetic programming of minimal neural nets using Occam’s razor. In: Forrest, S. (ed.) Proceedings of the 5th International Conference on Genetic Algorithms, ICGA 1993. University of Illinois at Urbana-Champaign, pp. 342–349. Morgan Kaufmann, San Francisco (1993)
Kalganova, T., Miller, J.: Evolving more efficient digital circuits by allowing circuit layout evolution and multi-objective fitness. In: Stoica, A., Lohn, J., Keymeulen, D. (eds.) The First NASA/DoD Workshop on Evolvable Hardware, Pasadena, California, pp. 54–63. IEEE Computer Society, Los Alamitos (1999)
Whitley, D., Starkweather, T., Bogart, C.: Genetic algorithms and neural networks: Optimizing connections and connectivity. In: Parallel Computing, vol. 14, pp. 347–361 (1990)
Aharonov-Barki, R., Beker, T., Ruppin, E.: Emergence of memory-driven command neurons in evolved artificial agents. Neural Computation 13, 691–716 (2001)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Ganon, Z., Keinan, A., Ruppin, E. (2003). Evolutionary Network Minimization: Adaptive Implicit Pruning of Successful Agents. In: Banzhaf, W., Ziegler, J., Christaller, T., Dittrich, P., Kim, J.T. (eds) Advances in Artificial Life. ECAL 2003. Lecture Notes in Computer Science(), vol 2801. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-39432-7_34
Download citation
DOI: https://doi.org/10.1007/978-3-540-39432-7_34
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-20057-4
Online ISBN: 978-3-540-39432-7
eBook Packages: Springer Book Archive