Original Contribution: Training a 3-node neural network is NP-complete

Explore this paper's citation graph

Summary

It is NP-complete to decide whether there exist weights and thresholds for this network so that it produces output consistent with a given set of training examples, and this results suggest that those looking for perfect training algorithms cannot escape inherent computational difficulties just by considering only simple or very regular networks.

Type
article
Published
1992-01-05
Cited by
999
References
16
Access
Open access

Keywords

Simple (philosophy), Computer science, Node (physics), Artificial neural network, Set (abstract data type)

References

Cited by

Related papers