Global Exponential Stability of Multitime Scale Competitive Neural Networks With Nonsmooth Functions

Finite-Time Stabilization of Competitive Neural Networks With Time-Varying Delays

This article investigates finite-time stabilization of competitive neural networks with discrete time-varying delays (DCNNs). By virtue of comparison strategies and inequality techniques, finite-time stabilization of the underlying DCNNs is analyzed by designing a discontinuous state feedback controller, which simplifies the controller design and proof processes of some existing results. Meanwhile, global exponential stabilization of the DCNNs is provided under a continuous state feedback controller. In addition, global exponential stability of the DCNNs is shown as an M-matrix, which contains some published outcomes as special cases. Finally, three examples are given to illuminate the validity of the theories.

Global Asymptotic Stability of Competitive Neural Networks with Reaction-Diffusion Terms and Mixed Delays

In this article, a new competitive neural network (CNN) with reaction-diffusion terms and mixed delays is proposed. Because this network system contains reaction-diffusion terms, it belongs to a partial differential system, which is different from the existing classic CNNs. First, taking into account the spatial diffusion effect, we introduce spatial diffusion for CNNs. Furthermore, since the time delay has an essential influence on the properties of the system, we introduce mixed delays including time-varying discrete delays and distributed delays for CNNs. By constructing suitable Lyapunov–Krasovskii functionals and virtue of the theories of delayed partial differential equations, we study the global asymptotic stability for the considered system. The effectiveness and correctness of the proposed CNN model with reaction-diffusion terms and mixed delays are verified by an example. Finally, some discussion and conclusions for recent developments of CNNs are given.

Exponential Synchronization of Memristor-Based Competitive Neural Networks With Reaction-Diffusions and Infinite Distributed Delays

Taking into account the infinite distributed delays and reaction-diffusions, this article investigates the global exponential synchronization problem of a class of memristor-based competitive neural networks (MCNNs) with different time scales. Based on the Lyapunov-Krasovskii functional and inequality approach, an adaptive control approach is proposed to ensure the exponential synchronization of the addressed drive-response networks. The closed-loop system is a discontinuous and delayed partial differential system in a cascade form, involving the spatial diffusion, the infinite distributed delays, the parametric adaptive law, the state-dependent switching parameters, and the variable structure controllers. By combining the theories of nonsmooth analysis, partial differential equation (PDE) and adaptive control, we present a new analytical method for rigorously deriving the synchronization of the states of the complex system. The derived m-norm (m ≥ 2)-based synchronization criteria are easily verified and the theoretical results are easily extended to memristor-based neural networks (NNs) without different time scales and reaction-diffusions. Finally, numerical simulations are presented to verify the effectiveness of the theoretical results.

Multiple-Timescale Neural Networks: Generation of History-Dependent Sequences and Inference Through Autonomous Bifurcations

Sequential transitions between metastable states are ubiquitously observed in the neural system and underlying various cognitive functions such as perception and decision making. Although a number of studies with asymmetric Hebbian connectivity have investigated how such sequences are generated, the focused sequences are simple Markov ones. On the other hand, fine recurrent neural networks trained with supervised machine learning methods can generate complex non-Markov sequences, but these sequences are vulnerable against perturbations and such learning methods are biologically implausible. How stable and complex sequences are generated in the neural system still remains unclear. We have developed a neural network with fast and slow dynamics, which are inspired by the hierarchy of timescales on neural activities in the cortex. The slow dynamics store the history of inputs and outputs and affect the fast dynamics depending on the stored history. We show that the learning rule that requires only local information can form the network generating the complex and robust sequences in the fast dynamics. The slow dynamics work as bifurcation parameters for the fast one, wherein they stabilize the next pattern of the sequence before the current pattern is destabilized depending on the previous patterns. This co-existence period leads to the stable transition between the current and the next pattern in the non-Markov sequence. We further find that timescale balance is critical to the co-existence period. Our study provides a novel mechanism generating robust complex sequences with multiple timescales. Considering the multiple timescales are widely observed, the mechanism advances our understanding of temporal processing in the neural system.

Multistability and associative memory of neural networks with Morita-like activation functions

This paper presents the multistability analysis and associative memory of neural networks (NNs) with Morita-like activation functions. In order to seek larger memory capacity, this paper proposes Morita-like activation functions. In a weakened condition, this paper shows that the NNs with n-neurons have (2m+1)ⁿ equilibrium points (Eps) and (m+1)ⁿ of them are locally exponentially stable, where the parameter m depends on the Morita-like activation functions, called Morita parameter. Also the attraction basins are estimated based on the state space partition. Moreover, this paper applies these NNs into associative memories (AMs). Compared with the previous related works, the number of Eps and AM's memory capacity are extensively increased. The simulation results are illustrated and some reliable associative memories examples are shown at the end of this paper.

Multistability of delayed fractional-order competitive neural networks

This paper is concerned with the multistability of fractional-order competitive neural networks (FCNNs) with time-varying delays. Based on the division of state space, the equilibrium points (EPs) of FCNNs are given. Several sufficient conditions and criteria are proposed to ascertain the multiple O(t^-α)-stability of delayed FCNNs. The O(t^-α)-stability is the extension of Mittag-Leffler stability of fractional-order neural networks, which contains monostability and multistability. Moreover, the attraction basins of the stable EPs of FCNNs are estimated, which shows the attraction basins of the stable EPs can be larger than the divided subsets. These conditions and criteria supplement and improve the previous results. Finally, the results are illustrated by the simulation examples.

Global exponential stability of bidirectional associative memory neural networks with time delays

In this paper, we consider delayed bidirectional associative memory (BAM) neural networks (NNs) with Lipschitz continuous activation functions. By applying Young's inequality and Hoelder's inequality techniques together with the properties of monotonic continuous functions, global exponential stability criteria are established for BAM NNs with time delays. This is done through the use of a new Lyapunov functional and an M-matrix. The results obtained in this paper extend and improve previous results.

Multiperiodicity and attractivity of delayed recurrent neural networks with unsaturating piecewise linear transfer functions

This paper studies multiperiodicity and attractivity for a class of recurrent neural networks (RNNs) with unsaturating piecewise linear transfer functions and variable delays. Using local inhibition, conditions for boundedness and global attractivity are established. These conditions allow coexistence of stable and unstable trajectories. Moreover, multiperiodicity of the network is investigated by using local invariant sets. It shows that under some interesting conditions, there exists one periodic trajectory in each invariant set which exponentially attracts all trajectories in that region correspondingly. Simulations are carried out to illustrate the theories.