Neural Comp. Sign up for ETOCS
HOME HELP FEEDBACK SUBSCRIPTIONS ARCHIVE SEARCH TABLE OF CONTENTS
 QUICK SEARCH:   [advanced]


     


This Article
Right arrow Full Text (PDF)
Right arrow Alert me when this article is cited
Right arrow Alert me if a correction is posted
Services
Right arrow Similar articles in this journal
Right arrow Alert me to new issues of the journal
Right arrow Download to citation manager
Right arrow reprints & permissions
Citing Articles
Right arrow Citing Articles via HighWire
Right arrow Citing Articles via Google Scholar
Google Scholar
Right arrow Articles by Feng, J.
Right arrow Articles by Brown, D.
Right arrow Search for Related Content
PubMed
Right arrow Articles by Feng, J.
Right arrow Articles by Brown, D.

Neural Computation, Vol 10, 189-214, Copyright © 1998 by The MIT Press


LETTERS

Fixed Point Attractor Analysis for a Class of Neurodynamics

Jianfeng Feng and David Brown

Nearly all models in neural networks start from the assumption that the input-output characteristic is a sigmoidal function. On parameter space, we present a systematic and feasible method for analyzing the whole spectrum of attractors -- all-saturated, all-but-one-saturated, all-but-two-saturated, and so on -- of a neurodynamical system with a saturated sigmoidal function as its input-output characteristic. We present an argument that claims, under a mild condition, that only all-saturated or all-but-one-saturated attractors are observable for the neurodynamics. For any given all-saturated configuration (all-but-one-saturated configuration ) the article shows how to construct an exact parameter region R()(bar-R( )) such that if and only if the parameters fall within R()(bar-R( )), then () is an attractor (a fixed point of the dynamics). The parameter region for an all-saturated fixed-point attractor is independent of the specific choice of a saturated sigmoidal function, whereas for an all-but-one-saturated fixed point, it is sensitive to the input-output characteristic. Based on a similar idea, the role of weight normalization realized by a saturated sigmoidal function in competitive learning is discussed. A necessary and sufficient condition is provided to distinguish two kinds of competitive learning: stable competitive learning with the weight vectors representing extremes of input space and being fixed-point attractors, and unstable competitive learning. We apply our results to Linsker's model and (using extreme value theory in statistics) the Hopfield model and obtain some novel results on these two models.


This article has been cited by other articles:


Home page
Neural Comput.Home page
C. Cebulla
Asymptotic behavior and synchronizability characteristics of a class of recurrent neural networks.
Neural Comput., September 1, 2007; 19(9): 2492 - 2514.
[Abstract] [Full Text] [PDF]


Home page
Neural Comput.Home page
M. Atencia, G. Joya, and F. Sandoval
Dynamical Analysis of Continuous Higher-Order Hopfield Networks for Combinatorial Optimization
Neural Comput., August 1, 2005; 17(8): 1802 - 1819.
[Abstract] [Full Text] [PDF]




HOME HELP FEEDBACK SUBSCRIPTIONS ARCHIVE SEARCH TABLE OF CONTENTS
J COGNITIVE NEUROSCIENCE NEURAL COMPUTATION MIT PRESS JOURNALS
Copyright © 1998 by The MIT Press.