Learning as a nonlinear line of attraction in a recurrent neural network

Abstract

A method to embed N dimensional, multi-valued patterns into an auto-associative memory represented as a nonlinear line of attraction in a fully connected recurrent neural network is presented in this paper. The curvature of the nonlinear attractor is defined by the Kth degree polynomial line which best fits the training data in N dimensional state space. The width of the nonlinear line is then characterized by the statistical characteristics of the training patterns. Stability of the recurrent network is verified by analyzing the trajectory of the points in the state space during convergence. The performance of the network is benchmarked through the reconstruction of original gray-scale images from their corrupted versions. It is observed that the proposed method can quickly and successfully reconstruct each image with an average convergence rate of 3.10 iterations.