Three-state neural network: from mutual information to the hamiltonian

Physics – Condensed Matter – Statistical Mechanics

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

10 pages (including 6 postscript figures)

Scientific paper

The mutual information, I, of the three-state neural network can be obtained exactly for the mean-field architecture, as a function of three macroscopic parameters: the overlap, the neural activity and the {\em activity-overlap}, i.e. the overlap restricted to the active neurons. We perform an expansion of I on the overlap and the activity-overlap, around their values for neurons almost independent on the patterns. From this expansion we obtain an expression for a Hamiltonian which optimizes the retrieval properties of this system. This Hamiltonian has the form of a disordered Blume-Emery-Griffiths model. The dynamics corresponding to this Hamiltonian is found. As a special characteristic of such network, we see that information can survive even if no overlap is present. Hence the basin of attraction of the patterns and the retrieval capacity is much larger than for the Hopfield network. The extreme diluted version is analized, the curves of information are plotted and the phase diagrams are built.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

Three-state neural network: from mutual information to the hamiltonian does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Three-state neural network: from mutual information to the hamiltonian, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Three-state neural network: from mutual information to the hamiltonian will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-244749

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.