PubMed Health⌕ Search

PubMed · 10935459

Cascade associative memory storing hierarchically correlated patterns with various correlations.

Abstract

In conventional models for storing hierarchically correlated patterns, correlations between ancestors (first-level patterns) and their descendants (second-level ones) are assumed to be uniform, so that the descendants are distributed around their ancestors with equal distances. However, this assumption might be unnatural. We believe that objects are encoded into patterns by preserving the similarity between them. In this case, descendants are distributed around their ancestors with various distances, so that the assumption is invalid and the conventional models become inapplicable. To overcome this, we propose a model CASM3 for storing hierarchically correlated patterns with various correlations. In CASM3, critical load levels vary with the descendants, and become higher with increasing correlations. Increase in load level successively destroys the memories of the descendants in descending order of their correlations. The size of the basins of attraction depends on the range of the correlations, and becomes larger as the correlation range is shifted toward lower levels.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

M Hirahara, N Oka, T Kindo. 2000. Cascade associative memory storing hierarchically correlated patterns with various correlations.. https://doi.org/10.1016/s0893-6080(99)00089-1

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related citations

A statistical property of multiagent learning based on Markov decision process.

We exhibit an important property called the asymptotic equipartition property (AEP) on empirical sequences in an ergodic multiagent Markov decision process (MDP). Using the AEP which facilitates the analysis of multiagent learning, we give a statistical property of multiagent learning, such as reinforcement learning (RL), near the end of the learning process. We examine the effect of the conditions among the agents on the achievement of a cooperative policy in three different cases: blind, visible, and communicable. Also, we derive a bound on the speed with which the empirical sequence converges to the best sequence in probability, so that the multiagent learning yields the best cooperative result.

Learning↗

Second order neurons and learning in Cohen-Grossberg networks.

The well known Cohen-Grossberg network is modified to include second order neural interconnections and also to have a learning component. Sufficient conditions are obtained for the existence of a globally exponentially stable equilibrium. The model provides a two-fold generalization of the Cohen-Grossberg network in the sense if one removes the learning component, then one gets a network with second order synaptic interactions; if both the learning component and the second order interactions are removed, then the model reduces to the standard Cohen-Grossberg network.

Learning↗