Dataset Information

Pattern recognition in neural networks with competing dynamics: coexistence of fixed-point and cyclic attractors.

ABSTRACT: We study the properties of the dynamical phase transition occurring in neural network models in which a competition between associative memory and sequential pattern recognition exists. This competition occurs through a weighted mixture of the symmetric and asymmetric parts of the synaptic matrix. Through a generating functional formalism, we determine the structure of the parameter space at non-zero temperature and near saturation (i.e., when the number of stored patterns scales with the size of the network), identifying the regions of high and weak pattern correlations, the spin-glass solutions, and the order-disorder transition between these regions. This analysis reveals that, when associative memory is dominant, smooth transitions appear between high correlated regions and spurious states. In contrast when sequential pattern recognition is stronger than associative memory, the transitions are always discontinuous. Additionally, when the symmetric and asymmetric parts of the synaptic matrix are defined in terms of the same set of patterns, there is a discontinuous transition between associative memory and sequential pattern recognition. In contrast, when the symmetric and asymmetric parts of the synaptic matrix are defined in terms of independent sets of patterns, the network is able to perform both associative memory and sequential pattern recognition for a wide range of parameter values.

SUBMITTER: Herrera-Aguilar JL

PROVIDER: S-EPMC3416842 | biostudies-literature | 2012

REPOSITORIES: biostudies-literature

ACCESS DATA

Publications

Pattern recognition in neural networks with competing dynamics: coexistence of fixed-point and cyclic attractors.

Herrera-Aguilar José L JL Larralde Hernán H Aldana Maximino M

PloS one 20120810 8

We study the properties of the dynamical phase transition occurring in neural network models in which a competition between associative memory and sequential pattern recognition exists. This competition occurs through a weighted mixture of the symmetric and asymmetric parts of the synaptic matrix. Through a generating functional formalism, we determine the structure of the parameter space at non-zero temperature and near saturation (i.e., when the number of stored patterns scales with the size o ...[more]

PMID: 22900014

Similar Datasets

Project description:The analysis of gene network robustness to noise and mutation is important for fundamental and practical reasons. Robustness refers to the stability of the equilibrium expression state of a gene network to variations of the initial expression state and network topology. Numerical simulation of these variations is commonly used for the assessment of robustness. Since there exists a great number of possible gene network topologies and initial states, even millions of simulations may be still too small to give reliable results. When the initial and equilibrium expression states are restricted to being saturated (i.e., their elements can only take values 1 or -1 corresponding to maximum activation and maximum repression of genes), an analytical gene network robustness assessment is possible. We present this analytical treatment based on determination of the saturated fixed point attractors for sigmoidal function models. The analysis can determine (a) for a given network, which and how many saturated equilibrium states exist and which and how many saturated initial states converge to each of these saturated equilibrium states and (b) for a given saturated equilibrium state or a given pair of saturated equilibrium and initial states, which and how many gene networks, referred to as viable, share this saturated equilibrium state or the pair of saturated equilibrium and initial states. We also show that the viable networks sharing a given saturated equilibrium state must follow certain patterns. These capabilities of the analytical treatment make it possible to properly define and accurately determine robustness to noise and mutation for gene networks. Previous network research conclusions drawn from performing millions of simulations follow directly from the results of our analytical treatment. Furthermore, the analytical results provide criteria for the identification of model validity and suggest modified models of gene network dynamics. The yeast cell-cycle network is used as an illustration of the practical application of this analytical treatment.

Project description:This research aims to analyze the effects of different parameter estimation on the recognition performance of satellite modulation signals based on deep learning (DL) under low signal to noise ratio (SNR) or channel non-ideal conditions. In this study, first, the common characteristics of broadband satellite modulation signal and the commonly used signal feature extraction algorithm are introduced. Then, the broadband satellite modulation signal pattern recognition model based on deformable convolutional neural networks (DCNN) is built, and the broadband satellite signal simulation is conducted based on Matlab software. Next, the signal characteristics of binary phase shift keying (BPSK), quadrature phase shift keying (QPSK), 8 phase shift keying (PSK), 16 quadratic amplitude modulation (QAM), 64QAM, and 32 absolute phase shift keying (APSK) are extracted by the constellation map, and the ratio changes of T1 and T2 with SNR are compared. When SNR is given, it is compared with VGG model, AlexNet model, and ResNe model. The results show that the constellation points of satellite signals with different modulations are evenly distributed. T1 of PSK modulation signals increases significantly with the increase of SNR. When SNR is greater than 10, PSK modulation signals can be identified. When T2 is set and SNR is greater than 15dB, 16QAM and 32APSK signals can be distinguished. In the model, the Relu activation function, mini-batch gradient descent (MBGD) algorithm, and Softmax classifier have the best recognition accuracy. PSK modulation signals have the best recognition rate when the SNR is 0dB, and the recognition accuracy of different modulation signals at 20dB is over 98%. When the data length reaches 4000, the recognition accuracy of different modulation signals is higher than 97%. Compared with other algorithms, this algorithm has the highest recognition accuracy (99.83%) and shorter training time (3960s). In conclusion, the broadband satellite modulation signal pattern recognition algorithm of DCNN constructed in this study can effectively identify the patterns of different modulation signals.

Dataset Information

Pattern recognition in neural networks with competing dynamics: coexistence of fixed-point and cyclic attractors.

Publications

Pattern recognition in neural networks with competing dynamics: coexistence of fixed-point and cyclic attractors.

Similar Datasets

OmicsDI is part of the ELIXIR infrastructure

Tweets