Search PubMed⌕ Search

PubMed · 11970677

Categorization in fully connected multistate neural network models.

Abstract

The categorization ability of fully connected neural network models, with either discrete or continuous Q-state units, is studied in this work in replica symmetric mean-field theory. Hierarchically correlated multistate patterns in a two level structure of ancestors and descendents (examples) are embedded in the network and the categorization task consists in recognizing the ancestors when the network is trained exclusively with their descendents. Explicit results for the dependence of the equilibrium properties of a Q=3-state model and a Q=infinity-state model are obtained in the form of phase diagrams and categorization curves. A strong improvement of the categorization ability is found when the network is trained with examples of low activity. The categorization ability is found to be robust to finite threshold and synaptic noise. The Almeida-Thouless lines that limit the validity of the replica-symmetric results, are also obtained.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

R Erichsen, W K Theumann, D R Dominguez. 1999. Categorization in fully connected multistate neural network models.. https://doi.org/10.1103/physreve.60.7321

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↗