Combined local search strategy for learning in networks of binary synapses

Physics – Condensed Matter – Disordered Systems and Neural Networks

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

7 pages, 4 figures, figures and references added

Scientific paper

10.1209/0295-5075/96/58003

Learning in networks of binary synapses is known to be an NP-complete problem. A combined stochastic local search strategy in the synaptic weight space is constructed to further improve the learning performance of a single random walker. We apply two correlated random walkers guided by their Hamming distance and associated energy costs (the number of unlearned patterns) to learn a same large set of patterns. Each walker first learns a small part of the whole pattern set (partially different for both walkers but with the same amount of patterns) and then both walkers explore their respective weight spaces cooperatively to find a solution to classify the whole pattern set correctly. The desired solutions locate at the common parts of weight spaces explored by these two walkers. The efficiency of this combined strategy is supported by our extensive numerical simulations and the typical Hamming distance as well as energy cost is estimated by an annealed computation.

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

Combined local search strategy for learning in networks of binary synapses 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 Combined local search strategy for learning in networks of binary synapses, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Combined local search strategy for learning in networks of binary synapses will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-333925

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