Hostname: page-component-848d4c4894-v5vhk Total loading time: 0 Render date: 2024-06-28T17:46:56.915Z Has data issue: false hasContentIssue false

One-dimensional Kohonen maps are super-stable with exponential rate

Published online by Cambridge University Press:  01 July 2016

Robert M. Burton*
Affiliation:
Oregon State University
David C. Plaehn*
Affiliation:
Oregon State University
*
Postal address: Department of Mathematics, Oregon State University, Corvallis, Oregon 97331, USA.
Postal address: Department of Mathematics, Oregon State University, Corvallis, Oregon 97331, USA.

Abstract

Kohonen self-organizing interval maps are considered. In this model a linear graph is embedded randomly into the unit interval. At each time a point is chosen randomly according to a fixed distribution. The nearest vertex and some of its nearby neighbors are moved closer to the point. These models have been proposed as models of learning in the audio-cortex. The models possess not only the structure of a Markov chain, but also the added structure of a random dynamical system. This structure is used to show that for a large class of these models, in a strong way, the initial conditions are unimportant and only the dynamics govern the future. A contractive condition is proven in spite of the fact that the maps are not continuous. This, in turn, shows that the Markov chain is uniformly ergodic.

Type
General Applied Probability
Copyright
Copyright © Applied Probability Trust 1999 

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Footnotes

Research supported by AFOSR grant 90-0251.

References

BOUTON, C. and Pagès, G. (1993). Self-organization and a.s. convergence of the one-dimensional Kohonen algorithm with non-uniformly distributed stimuli. Stoch. Proc. Appl. 47, 249274.Google Scholar
BOUTON, C. and Pagès, G. (1994). Convergence in distribution of the one-dimensional Kohonen algorithms when the stimuli are not uniform. Adv. Appl. Prob. 26, 80103.CrossRefGoogle Scholar
Burton, R. M. and Faris, W. G. (1996). A self-organizing cluster process. Ann. Appl. Prob. 6, 12321247.Google Scholar
BURTON, R. M and Keller, G. (1993). Stationary measures for randomly chosen maps. J. Theoret. Prob. 6, 116.CrossRefGoogle Scholar
DOOB, J. L. (1953). Stochastic Processes. Wiley, New York.Google Scholar
DUDLEY, R. M. (1989). Real Analysis and Probability. Wadsworth and Brooks/Cole, Belmont, CA.Google Scholar
Cottrell, M. and Fort, J.-C. (1987). Étude d'un processus d'auto-organization. Ann. Inst. Henri Poincaré, Prob. Statist. 23, 120.Google Scholar
FLANAGAN, J. A. (1994). Self-organizing Neural Networks. , Ecole Polytechnique Fédérale de Lausanne (switzerland).Google Scholar
Kamae, T., Krengel, U. and O'BRIEN, G. L. (1977). Stochastic inequalities on partially ordered spaces. Ann. Prob. 5, 899912.Google Scholar
Kifer, Y. (1986). Ergodic Theory of Random Transformations. Birkhäuser, Boston.Google Scholar
Kohonen, T. (1989). Self-Organization and Associative Memory, 3rd edn, Springer, Berlin.Google Scholar
MEYN, S. P. and TWEEDIE, R. L. (1983). Markov Chains and Stochastic Stability. Springer, London.Google Scholar
POLLARD, D. (1984). Convergence of Stochastic Processes. Springer, New York.Google Scholar
REVUZ, D. (1975). Markov Chains. North-Holland, Amsterdam.Google Scholar
RITTER, H. MARTINETZ, T. and SCHULTEN, K. (1992). Neural Computation and Self-Organizing Maps: An Introduction. Addison-Wesley, Reading, MA.Google Scholar