An exact learning algorithm for autoassociative neural networks with binary couplings

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.

LaTeX (ioplppt style), 5 pages, 2 (LaTeX) pictures

Cited by in corpus (2)

• Techniques of replica symmetry breaking and the storage problem of the McCulloch-Pitts neuron
• Learning by random walks in the weight space of the Ising perceptron