Pattern reconstruction and sequence processing in feed-forward layered neural networks near saturation

Abstract

The dynamics and the stationary states for the competition between pattern reconstruction and asymmetric sequence processing are studied here in an exactly solvable feed-forward layered neural network model of binary units and patterns near saturation. Earlier work by Coolen and Sherrington on a parallel dynamics far from saturation is extended here to account for finite stochastic noise due to a Hebbian and a sequential learning rule. Phase diagrams are obtained with stationary states and quasi-periodic non-stationary solutions. The relevant dependence of these diagrams and of the quasi-periodic solutions on the stochastic noise and on initial inputs for the overlaps is explicitly discussed.

9 pages, 7 figures

References in corpus (6)

• Phase Diagram and Storage Capacity of Sequence Processing Neural Networks
• Transient dynamics for sequence processing neural networks
• Retrieval dynamics of neural networks for sparsely coded sequential patterns
• The path-integral analysis of an associative memory model storing an infinite number of finite limit cycles
• Mean-field dynamics of sequence processing neural networks with finite connectivity
• Retrieval Properties of Hopfield and Correlated Attractors in an Associative Memory Model

Cited by in corpus (1)

• Period-two cycles in a feed-forward layered neural network model with symmetric sequence processing