On the Asymptotic Information Storage Capacity of Neural Networks

Palm, G

doi:10.1007/978-3-642-83740-1_29

Item

ITEM ACTIONSEXPORT

Add to Basket

Local TagsRelease HistoryDetailsSummary

Released

Conference Paper

On the Asymptotic Information Storage Capacity of Neural Networks

MPS-Authors

/persons/resource/persons225707

Palm, G
Former Department Structure and Function of Natural Nerve-Net , Max Planck Institute for Biological Cybernetics, Max Planck Society;
Max Planck Institute for Biological Cybernetics, Max Planck Society;

External Resource

https://link.springer.com/content/pdf/10.1007%2F978-3-642-83740-1_29.pdf
(Publisher version)

Fulltext (restricted access)

There are currently no full texts shared for your IP range.

Fulltext (public)

There are no public fulltexts stored in PuRe

Supplementary Material (public)

There is no public supplementary material available

Citation

Palm, G. (1989). On the Asymptotic Information Storage Capacity of Neural Networks. In R. Eckmiller, & C. von der Malsburg (Eds.), Neural Computers (pp. 271-280). Berlin, Germany: Springer.

Cite as: https://hdl.handle.net/21.11116/0000-0006-9F67-4

Abstract

Neural networks can be useful and economic as associative memories, even in technical applications. The asymptotic information storage capacity of such neural networks is defined and then calculated and compared for various local synaptic rules. It turns out that among these rules the simple Hebb rule is optimal in terms of its storage capacity. Furthermore the capacity of the clipped Hebb rule (C = In 2) is even higher than the capacity of the unclipped Hebb rule (C = 1/(8-ln 2)).