Abstract
We show in a very general framework the a.s. convergence of the one-dimensional Kohonen algorithm–after self-organization–to its unique equilibrium when the learning rate decreases to 0 in a suitable way. The main requirement is a log-concavity assumption on the stimuli distribution which includes all the usual (truncated) probability distributions (uniform, exponential, gamma distribution with parameter ≥ 1, etc.). For the constant step algorithm, the weak convergence of the invariant distributions towards equilibrium as the step goes to 0 is established too. The main ingredients of the proof are the Poincaré-Hopf Theorem and a result of Hirsch on the convergence of cooperative dynamical systems.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.