Complex-Valued Multilayer Perceptron Search Utilizing Eigen Vector Descent and Reducibility Mapping
A complex-valued multilayer perceptron (MLP) can approximate a periodic or unbounded function, which cannot be easily realized by a real-valued MLP. Its search space is full of crevasse-like forms having huge condition numbers; thus, it is very hard for existing methods to perform efficient search in such a space. The space also includes the structure of reducibility mapping. The paper proposes a new search method for a complex-valued MLP, which employs both eigen vector descent and reducibility mapping, aiming to stably find excellent solutions in such a space. Our experiments showed the proposed method worked well.
Keywordscomplex-valued multilayer perceptron Wirtinger calculus search method eigen vector reducibility mapping
Unable to display preview. Download preview PDF.
- 1.Amin, M. F., Amin, M.I., Al-Nuaimi, A.Y.H., Murase, K.: Wirtinger Calculus Based Gradient Descent and Levenberg-Marquardt Learning Algorithms in Complex-Valued Neural Networks. In: Lu, B.-L., Zhang, L., Kwok, J. (eds.) ICONIP 2011, Part I. LNCS, vol. 7062, pp. 550–559. Springer, Heidelberg (2011)CrossRefGoogle Scholar
- 2.Delgado, K.K.: The complex gradient operator and the CR-calculus. ECE275A-Lecture Supplement, Fall (2006)Google Scholar
- 6.Luenberger, D.G.: Linear and nonlinear programming. Addison-Wesley (1984)Google Scholar
- 8.Nakano, R., Satoh, S., Ohwaki, T.: Learning method utilizing singular region of multilayer perceptron. In: Proc. 3rd Int. Conf. on Neural Computation Theory and Applications, pp. 106–111 (2011)Google Scholar
- 9.Nitta, T.: Reducibility of the complex-valued neural network. Neural Information Processing - Letters and Reviews 2(3), 53–56 (2004)Google Scholar