arXiv · cond-mat/9706043
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.
Explore related subjects
Keep this discovery
Explore connections, maps & timelines
G. Milde, S. Kobe. 1997-06-05. An exact learning algorithm for autoassociative neural networks with binary couplings. https://doi.org/10.1088/0305-4470%2F30%2F7%2F016
Cite the original work for its findings. Save a collection to share your selection of sources.