An exact learning algorithm for autoassociative neural networks with binary couplings

and

Published under licence by IOP Publishing Ltd
, , Citation G Milde and S Kobe 1997 J. Phys. A: Math. Gen. 30 2349 DOI 10.1088/0305-4470/30/7/016

Download Article PDF

Article metrics

71 Total downloads

Share this article

Author affiliations

1 Institut für Theoretische Physik, Technische Universität Dresden, D-01062 Dresden, Germany

Dates

  1. Received 7 October 1996

Buy this article in print

0305-4470/30/7/2349

Abstract

Exact solutions for the learning problem of autoassociative networks with binary couplings are determined by a new method. The use of a branch-and-bound algorithm leads to a substantial saving of computational time compared with complete enumeration. As a result, fully connected networks with up to 40 neurons could be investigated. The network capacity is found to be close to 0.83.

Export citation and abstract BibTeX RIS

Previous article in issue
Next article in issue
10.1088/0305-4470/30/7/016