×

Dynamics of learning near singularities in radial basis function networks. (English) Zbl 1254.68230

Summary: The radial basis function (RBF) networks are one of the most widely used models for function approximation in the regression problem. In the learning paradigm, the best approximation is recursively or iteratively searched for based on observed data (teacher signals). One encounters difficulties in such a process when two component basis functions become identical, or when the magnitude of one component becomes null. In this case, the number of the components reduces by one, and then the reduced component recovers as the learning process proceeds further, provided such a component is necessary for the best approximation. Strange behaviors, especially the plateau phenomena, have been observed in dynamics of learning when such reduction occurs. There exist singularities in the space of parameters, and the above reduction takes place at the singular regions. This paper focuses on a detailed analysis of the dynamical behaviors of learning near the overlap and elimination singularities in RBF networks, based on the averaged learning equation that is applicable to both on-line and batch mode learning. We analyze the stability on the overlap singularity by solving the eigenvalues of the Hessian explicitly. Based on the stability analysis, we plot the analytical dynamic vector fields near the singularity, which are then compared to those real trajectories obtained by a numeric method. We also confirm the existence of the plateaus in both batch and on-line learning by simulation.

MSC:

68T05 Learning and adaptive systems in artificial intelligence
92B20 Neural networks for/in biological studies, artificial life and related topics
Full Text: DOI

References:

[1] Amari, S., Theory of adaptive pattern classifiers, IEEE Transactions on Electronic Computers, EC-16, 3, 299-307 (1967) · Zbl 0189.50101
[2] Amari, S.; Park, H.; Ozeki, T., Singularities affect dynamics of learning in neuromanifolds, Neural Computation, 18, 1007-1065 (2006) · Zbl 1092.68636
[3] Biehl, M.; Schwarze, H., Learning by online gradient descent, Journal of Physics A-Mathematical and General, 28, 643-656 (1995) · Zbl 0960.68635
[4] Cousseau, F., Ozeki, T., & Amari, S. (2007). Dynamics of learning in multilayer perceptrons near the singularity. IEEE Transactions on Neural Networks; Cousseau, F., Ozeki, T., & Amari, S. (2007). Dynamics of learning in multilayer perceptrons near the singularity. IEEE Transactions on Neural Networks
[5] Freeman, J.; Saad, D., Dynamics of on-line learning in radial basis function networks, Physical Review E, 56, 907-916 (1997)
[6] Freeman, J.; Saad, D., Online learning in radial basis function networks, Neural Computation, 9, 1601-1622 (1997)
[7] Fukumizu, K., A regularity condition of information matrix of a multilayer perceptron network, Neural Networks, 9, 871-879 (1996)
[8] Fukumizu, K.; Amari, S., Local minima and plateaus in hierarchical structure of multilayer perceptrons, Neural Networks, 13, 317-327 (2000)
[9] Geman, S., Some averaging and stability results for random differential equations, SIAM Journal of Applied Mathematics, 36, 86-105 (1980) · Zbl 0412.60069
[10] Horn, R.; Johnson, C., Matrix analysis (1985), Cambridge University Press: Cambridge University Press Cambridge, England · Zbl 0576.15001
[11] Ostrowski, A., A quantitative formulation of Sylvester’s law of inertia, Proceedings of the National Academy of Sciences, 45, 740-744 (1959) · Zbl 0087.01802
[12] Park, H.; Inoue, M.; Okada, M., Slow dynamics due to singularities of hierarchical learning machines, Progress of Theoretical Physics Supplement, 157, 275-279 (2005) · Zbl 1077.82542
[13] Saad, D.; Solla, A., On-line learning in soft committee machines, Physical Review E, 52, 4, 4225-4243 (1995)
[14] Wei, H.; Zhang, J.; Cousseau, F.; Ozeki, T.; Amari, S., Dynamics of learning near singularities in layered networks, Neural Computation, 20, 3, 813-843 (2008) · Zbl 1138.68048
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.