ICONIP 2004: Neural Information Processing pp 524-529 | Cite as
One-Epoch Learning for Supervised Information-Theoretic Competitive Learning
Abstract
In this paper, we propose a new computational method for a supervised competitive learning method. In the supervised competitive learningmethod, information is controlled in an intermediate layer, and in an output layer, errors between targets and outputs are minimized. In the intermediate layer, competition is realized by maximizing mutual information between input patterns and competitive units with Gaussian functions. One problem is that a process of information maximization is computationally expensive. However, we have found that the method can produce appropriate performance with a small number of epochs. Thus, we restrict here the number of epochs to only one epoch for facilitating learning. This computational method can overcome the shortcoming of our information maximization method. We applied our method to chemical data processing. Experimental results showed that with only one epoch, the new computational method gave better performance than did the conventional methods.
Keywords
Mutual Information Output Layer Input Pattern Generalization Performance Information AcquisitionPreview
Unable to display preview. Download preview PDF.
References
- 1.Kamimura, R., Kamimura, T., Uchida, O.: Flexible feature discovery and structural information. Connection Science 13(4), 323–347 (2001)CrossRefGoogle Scholar
- 2.Kamimura, R., Kamimura, T., Takeuchi, H.: Greedy information acquisition algorithm: A new information theoretic approach to dynamic information acquisition in neural networks. Connection Science 14(2), 137–162 (2002)CrossRefGoogle Scholar
- 3.Kamimura, R.: Progressive feature extraction by greedy network-growing algorithm. Complex Systems 14(2), 127–153 (2003)MATHMathSciNetGoogle Scholar
- 4.DeSieno, D.: Adding a conscience to competitive learning. In: Proceedings of IEEE International Conference on Neural Networks, San Diego, pp. 117–124. IEEE, Los Alamitos (1988)CrossRefGoogle Scholar
- 5.Ahalt, S.C., Krishnamurthy, A.K., Chen, P., Melton, D.E.: Competitive learning algorithms for vector quantization. Neural Networks 3, 277–290 (1990)CrossRefGoogle Scholar
- 6.Xu, L.: Rival penalized competitive learning for clustering analysis, RBF net, and curve detection. IEEE Transaction on Neural Networks 4(4), 636–649 (1993)CrossRefGoogle Scholar
- 7.Hulle, M.M.V.: The formation of topographic maps that maximize the average mutual information of the output responses to noiseless input signals. Neural Computation 9(3), 595–606 (1997)CrossRefGoogle Scholar
- 8.Rumelhart, D.E., Zipser, D.: Feature discovery by competitive learning. Cognitive Science 9, 75–112Google Scholar
- 9.Hecht-Nielsen, R.: Counterpropagation networks. Applied Optics 26, 4979–4984 (1987)CrossRefGoogle Scholar