Welcome to the new version of CaltechAUTHORS. Login is currently restricted to library staff. If you notice any issues, please email coda@library.caltech.edu
Published 1988 | Published
Book Section - Chapter Open

Connectivity Versus Entropy


How does the connectivity of a neural network (number of synapses per neuron) relate to the complexity of the problems it can handle (measured by the entropy)? Switching theory would suggest no relation at all, since all Boolean functions can be implemented using a circuit with very low connectivity (e.g., using two-input NAND gates). However, for a network that learns a problem from examples using a local learning rule, we prove that the entropy of the problem becomes a lower bound for the connectivity of the network.

Additional Information

© 1988 AIP.

Attached Files

Published - 63-connectivity-versus-entropy.pdf


Files (1.3 MB)
Name Size Download all
1.3 MB Preview Download

Additional details

August 19, 2023
October 25, 2023