HOME HELP FEEDBACK SUBSCRIPTIONS ARCHIVE SEARCH TABLE OF CONTENTS		QUICK SEARCH:   [advanced] Author: Keyword(s): Year:  Vol:  Page:

This Article Full Text Full Text (PDF) Alert me when this article is cited Alert me if a correction is posted Services Similar articles in this journal Similar articles in PubMed Alert me to new issues of the journal Download to citation manager Citing Articles Citing Articles via HighWire Citing Articles via Google Scholar Google Scholar Articles by Tino, P. Articles by Giles, C. L. Search for Related Content PubMed PubMed Citation Articles by Tino, P. Articles by Giles, C. L.

Attractive Periodic Sets in Discrete-Time Recurrent Networks (with Emphasis on Fixed-Point Stability and Bifurcations in Two-Neuron Networks)

Aston University, Birmingham B4 7ET, U.K., and Department of Computer Science and Engineering, Slovak University of Technology, 812 19 Bratislava, Slovakia

Bill G. Horne

NEC Research Institute, Princeton, NJ 08540, U.S.A.

C. Lee Giles

NEC Research Institute, Princeton, NJ 08540, U.S.A., and School of Information Sciences and Technology, Pennsylvania State University, University Park, PA 16801, U.S.A.

We perform a detailed fixed-point analysis of two-unit recurrent neural networks with sigmoid-shaped transfer functions. Using geometrical arguments in the space of transfer function derivatives, we partition the network state-space into distinct regions corresponding to stability types of the fixed points. Unlike in the previous studies, we do not assume any special form of connectivity pattern between the neurons, and all free parameters are allowed to vary. We also prove that when both neurons have excitatory self-connections and the mutual interaction pattern is the same (i.e., the neurons mutually inhibit or excite themselves), new attractive fixed points are created through the saddle-node bifurcation. Finally, for an N-neuron recurrent network, we give lower bounds on the rate of convergence of attractive periodic points toward the saturation values of neuron activations, as the absolute values of connection weights grow.

This article has been cited by other articles:

				R. D. Beer Parameter space structure of continuous-time recurrent neural networks. Neural Comput., December 1, 2006; 18(12): 3009 - 3051. [Abstract] [Full Text] [PDF]

				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]

				P. Tino and B. Hammer Architectural Bias in Recurrent Neural Networks: Fractal Analysis Neural Comput., August 1, 2003; 15(8): 1931 - 1957. [Abstract] [Full Text]