Search

Abstract: The current paper reviews a connectionist model, the recurrent neural network with parametric biases (RNNPB), in which multiple behavior schemata can be learned by the network in a distributed manner. The parametric biases in the network play an essential role in both generating and recognizing behavior patterns. They act as a mirror system by means of self-organizing adequate memory structures. Three different robot experiments are reviewed: robot and user interactions; learning and generating different types of dynamic patterns; and linguistic-behavior binding. The hallmark of this study is explaining how self-organizing internal structures can contribute to generalization in learning, and diversity in behavior generation, in the proposed distributed representation scheme. [Copyright &y& Elsevier]

This paper derives a new sufficient condition for the exponential stability of the equilibrium point for delayed neural networks with time varying delays by employing a Lyapunov-Krasovskii functional and using Linear Matrix Inequality (LMI) approach. This result establishes a relation between the delay time and the parameters of the network. The result is also compared with the most recent result derived in the literature. [Copyright &y& Elsevier]

In this paper, a class of nonautonomous cellular neural networks is studied. By constructing a suitable Liapunov functional, applying the boundedness theorem for general functional–differential equations and the Banach fixed point theorem, a series of new criteria are obtained on the boundedness, global exponential stability, and existence of periodic solutions. [Copyright &y& Elsevier]

This paper presents a recurrent neural network for solving strict convex quadratic programming problems and related linear piecewise equations. Compared with the existing neural networks for quadratic program, the proposed neural network has a one-layer structure with a low model complexity. Moreover, the proposed neural network is shown to have a finite-time convergence and exponential convergence. Illustrative examples further show the good performance of the proposed neural network in real-time applications. [Copyright &y& Elsevier]

In this paper, we propose a new network growth model and its learning algorithm to more precisely model such a real-world growing network as the Web. Unlike the conventional models, we have incorporated directional attachment and community structure for this purpose. We show that the proposed model exhibits a degree distribution with a power-law tail, which is an important characteristic of many large-scale real-world networks including the Web. Using real Web data, we experimentally show that predictive ability can be improved by incorporating directional attachment and community structure. Also, using synthetic data, we experimentally show that predictive ability can definitely be improved by incorporating community structure. [Copyright &y& Elsevier]

Regression problem is an important application area for neural networks (NNs). Among a large number of existing NN architectures, the feedforward NN (FNN) paradigm is one of the most widely used structures. Although one-hidden-layer feedforward neural networks (OHL-FNNs) have simple structures, they possess interesting representational and learning capabilities. In this paper, we are interested particularly in incremental constructive training of OHL-FNNs. In the proposed incremental constructive training schemes for an OHL-FNN, input-side training and output-side training may be separated in order to reduce the training time. A new technique is proposed to scale the error signal during the constructive learning process to improve the input-side training efficiency and to obtain better generalization performance. Two pruning methods for removing the input-side redundant connections have also been applied. Numerical simulations demonstrate the potential and advantages of the proposed strategies when compared to other existing techniques in the literature. [Copyright &y& Elsevier]

Recently, a discrimination measure for feature extraction for two-class data, called the maximum discriminating (MDF) measure (Talukder and Casasent [Neural Networks 14 (2001) 1201–1218]), was introduced.In the present paper, it is shown that the MDF discrimination measure produces exactly the same results as the classical Fisher criterion, on the condition that the two prior probabilities are chosen to be equal. The effect of unequal priors on the efficiency of the measures is also discussed. [Copyright &y& Elsevier]

This paper evaluates a novel k-nearest neighbour (k-NN) classifier built from binary neural networks. The binary neural approach uses robust encoding to map standard ordinal, categorical and numeric data sets onto a binary neural network. The binary neural network uses high speed pattern matching to recall a candidate set of matching records, which are then processed by a conventional k-NN approach to determine the k-best matches. We compare various configurations of the binary approach to a conventional approach for memory overheads, training speed, retrieval speed and retrieval accuracy. We demonstrate the superior performance with respect to speed and memory requirements of the binary approach compared to the standard approach and we pinpoint the optimal configurations. [Copyright &y& Elsevier]

This paper presents numerical studies of applying back-propagation learning to a delayed recurrent neural network (DRNN). The DRNN is a continuous-time recurrent neural network having time delayed feedbacks and the back-propagation learning is to teach spatio-temporal dynamics to the DRNN. Since the time-delays make the dynamics of the DRNN infinite-dimensional, the learning algorithm and the learning capability of the DRNN are different from those of the ordinary recurrent neural network (ORNN) having no time-delays. First, two types of learning algorithms are developed for a class of DRNNs. Then, using chaotic signals generated from the Mackey-Glass equation and the Ro¨ssler equations, learning capability of the DRNN is examined. Comparing the learning algorithms, learning capability, and robustness against noise of the DRNN with those of the ORNN and time delay neural network, advantages as well as disadvantages of the DRNN are investigated. [Copyright &y& Elsevier]

The aim of the present paper is to apply Sudjanto-Hassoun theory of Hebbian learning to neural independent component analysis. The basic learning theory is first recalled and expanded in order to make it suitable for a network of non-linear complex-weighted neurons; then its interpretation and application is shown in the context of blind separation of complex-valued sources. Numerical results are given in order to assess the effectiveness of the proposed learning theory and the related separation algorithm on telecommunication signals; a comparison with other existing techniques finally helps assessing the performances and computational requirements of the proposed algorithm. [Copyright &y& Elsevier]

This paper investigates an important problem concerning the complexity of three-layer binary neural networks (BNNs) with one hidden layer. The neuron in the studied BNNs employs a hard limiter activation function with only integer weights and an integer threshold. The studies are focused on implementations of arbitrary Boolean functions which map from {0,1}n into {0,1}. A deterministic algorithm called set covering algorithm (SCA) is proposed for the construction of a three-layer BNN to implement an arbitrary Boolean function. The SCA is based on a unit sphere covering (USC) of the Hamming space (HS) which is chosen in advance. It is proved that for the implementation of an arbitrary Boolean function of n-variables (n≥3) by using SCA, ⌊3L/2⌋ hidden neurons are necessary and sufficient, where L is the number of unit spheres contained in the chosen USC of the n-dimensional HS. It is shown that by using SCA, the number of hidden neurons required is much less than that by using a two-parallel hyperplane method. In order to indicate the potential ability of three-layer BNNs, a lower bound on the required number of hidden neurons which is derived by using the method of estimating the Vapnik-Chervonenkis (VC) dimension is also given. [Copyright &y& Elsevier]

In this paper, we address the problem of stable tracking control of a flexible macro–micro manipulator (M3) system. A two-layer neural network is utilized to approximate the nonlinear robot dynamic behavior of the M3 system, and the controllers for the macro and micro arms are developed without any need for prior knowledge of the dynamic model of the controlled M3 system. A learning algorithm for the neural network using Lyapunov stability theory is derived. It is shown that both the tracking error and the weight-tuning error are uniformly ultimately bounded under this new control scheme. Simulation results are presented and compared to those obtained using a PD controller. [Copyright &y& Elsevier]

The long short-term memory (LSTM) network trained by gradient descent solves difficult problems which traditional recurrent neural networks in general cannot. We have recently observed that the decoupled extended Kalman filter training algorithm allows for even better performance, reducing significantly the number of training steps when compared to the original gradient descent training algorithm. In this paper we present a set of experiments which are unsolvable by classical recurrent networks but which are solved elegantly and robustly and quickly by LSTM combined with Kalman filters. [Copyright &y& Elsevier]

A neural network model called lateral interaction in accumulative computation for detection of non-rigid objects from motion of any of their parts in indefinite sequences of images is presented. Some biological evidences inspire the model. After introducing the model, the complete multi-layer neural architecture is offered in this paper. The architecture consists of four layers that perform segmentation by gray level bands, accumulative charge computation, charge redistribution by gray level bands and moving object fusion. The lateral interaction in accumulative computation associated learning algorithm is also introduced. Some examples that explain the usefulness of the system we propose are shown at the end of this article. [Copyright &y& Elsevier]

Abstract: This letter points out that the main ideas and conclusions of the “The No-Prop algorithm” paper which has recently appeared in this journal were proposed earlier by G.-B. Huang et al. 10 years ago and intensively discussed and applied by other authors in the past 10 years. [Copyright &y& Elsevier]