论文信息 - Links between LVQ and Backpropagation

Links between LVQ and Backpropagation

Abstract In this paper we show that there are some intriguing links between the Backpropagation and LVQ algorithms. We show that Backpropagation used for training the weights of radial basis function networks exhibits an increasing competitive nature as the dispersion parameters decrease. In particular, we prove that LVQ can be regarded as a competitive learning scheme taking place in radial basis function networks.

[1] Paolo Frasconi,et al. Learning without local minima in radial basis function networks , 1995, IEEE Trans. Neural Networks.

[2] Sargur N. Srihari,et al. Bayesian and neural network pattern recognition: a theoretical connection and empirical results with handwritten characters , 1991 .

[3] Alberto Tesi,et al. On the Problem of Local Minima in Backpropagation , 1992, IEEE Trans. Pattern Anal. Mach. Intell..

[4] Robert A. Jacobs,et al. Increased rates of convergence through learning rate adaptation , 1987, Neural Networks.

[5] John Moody,et al. Fast Learning in Networks of Locally-Tuned Processing Units , 1989, Neural Computation.

[6] James L. McClelland,et al. Parallel distributed processing: explorations in the microstructure of cognition, vol. 1: foundations , 1986 .

[7] Michael I. Jordan,et al. Task Decomposition Through Competition in a Modular Connectionist Architecture: The What and Where Vision Tasks , 1990, Cogn. Sci..

[8] Anil K. Jain,et al. Artificial Neural Networks and Statistical Pattern Recognition , 1991 .

[9] Geoffrey E. Hinton,et al. Learning sets of filters using back-propagation , 1987 .

[10] Teuvo Kohonen,et al. The self-organizing map , 1990 .

[11] John Scott Bridle,et al. Probabilistic Interpretation of Feedforward Classification Network Outputs, with Relationships to Statistical Pattern Recognition , 1989, NATO Neurocomputing.