Abstract
Genetic algorithms (GAs) are widely used in the parameter training of Neural Network (NN). In this paper, we investigate GAs based on our proposed novel genetic representation to train the parameters of NN. A splicing/decomposable (S/D) binary encoding is designed based on some theoretical guidance and existing recommendations. Our theoretical and empirical investigations reveal that the S/D binary representation is more proper than other existing binary encodings for GAs’ searching. Moreover, a new genotypic distance on the S/D binary space is equivalent to the Euclidean distance on the real-valued space during GAs convergence. Therefore, GAs can reliably and predictably solve problems of bounded complexity and the methods depended on the Euclidean distance for solving different kinds of optimization problems can be directly used on the S/D binary space. This investigation demonstrates that GAs based our proposed binary representation can efficiently and effectively train the parameters of NN.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Goldberg, D.E.: Genetic Algorithms in Search, Optimization, and Machine Learning. Addison-Wesley, Reading (1989)
Han, K.H., Kim, J.H.: Genetic Quantum Algorithm and Its Application to Combinatorial Optimization Problem. In: Proceeding of Congress on Evolutionary Computation, vol. 1, pp. 1354–1360 (2000)
Holland, J.H.: Adaptation in Natural and Artificial systems. University of Michigan Press, Ann Arbor (1975)
Julstrom, B.A.: Redundant Genetic Encodings Not Be Harmful. In: Proceedings of the Genetic and Evolutionary Computation Conference, vol. 1, p. 791. Morgan Kaufmann Publishers, San Francisco (1999)
Liang, Y., Leung, K.S.: Evolution Strategies with Exclusion-based Selection Operators and a Fourier Series Auxiliary Function. Applied Mathematics and Computation 174, 1080–1109 (2006)
Liang, Y., Leung, K.S., Lee, K.H.: A Splicing/Decomposable Encoding and Its Novel Operators for Genetic Algorithms. In: Proceeding of the ACM Genetic and Evolutionary Computation Conference, pp. 1225–1232 (2006)
Liang, Y., Leung, K.S., Lee, K.H.: A Novel Binary Variable Representation for Genetic and Evolutionary Algorithms. In: Proceeding of the 2006 IEEE World Congress on Computational Intelligence, pp. 2551–2558 (2006)
Liepins, G.E., Vose, M.D.: Representational Issues in Genetic Optimization. Journal of Experimental and Theoretical Artificial Intelligence 2, 101–115 (1990)
Rothlauf, F.: Representations for Genetic and Evolutionary Algorithms. Physica-Verlag, Heidelberg (2002)
Schaffer, J.D., Caruana, R.A., Eshelman, L.J., Das, R.: A Study of Control Parameters Affecting Online Performance of Genetic Algorithms for Function Optimization. In: Proceedings of the Third International Conference on Genetic Algorithms, Morgan Kaufmann, San Mateo (1989)
Thierens, D.: Analysis and Design of Genetic Algorithms. Katholieke Universiteit Leuven, Leuven, Belgium (1990)
Whitley, D.: Local Search and High Precision Gray Codes: Convergence Results and Neighborhoods. In: Martin, W., Spears, W. (eds.) Foundations of Genetic Algorithms 6, Morgan Kaufmann, San Francisco (2000)
Xu, Z.B., Leung, K.S., Liang, Y., Leung, Y.: Efficiency Speed-up Strategies for Evolutionary Computation: Fundamentals and Fast-GAs. Applied Mathematics and Computation 142, 341–388 (2003)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer Berlin Heidelberg
About this paper
Cite this paper
Liang, Y., Leung, KS., Xu, ZB. (2007). Neural Network Training Using Genetic Algorithm with a Novel Binary Encoding. In: Liu, D., Fei, S., Hou, Z., Zhang, H., Sun, C. (eds) Advances in Neural Networks – ISNN 2007. ISNN 2007. Lecture Notes in Computer Science, vol 4492. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-72393-6_45
Download citation
DOI: https://doi.org/10.1007/978-3-540-72393-6_45
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-72392-9
Online ISBN: 978-3-540-72393-6
eBook Packages: Computer ScienceComputer Science (R0)