Binary Willshaw learning yields high synaptic capacity for long-term familiarity memory

DOI10.1007/s00422-012-0488-4zbMath1237.92019arXiv1207.7196OpenAlexW3102277129WikidataQ47997657 ScholiaQ47997657MaRDI QIDQ420950

João Sacramento, Andreas Wichert

Publication date: 23 May 2012

Published in: Biological Cybernetics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1207.7196

zbMATH Keywords

Sparse codingWillshaw rule

Mathematics Subject Classification ID

Neural biology (92C20) Psychophysics and psychophysiology; perception (91E30)

Cites Work

• A Mathematical Theory of Communication
• On associative memory
• Optimising synaptic learning rules in linear associative memories
• Improving recall from an associative memory
• Optimal learning rules for familiarity detection
• Neural Associative Memory with Optimal Bayesian Learning
• Die Lernmatrix
• Neural Associative Memory and the Willshaw–Palm Probability Distribution
• Information capacity in recurrent McCulloch–Pitts networks with sparsely coded memory states
• Information storage in sparsely coded memory nets
• Storage capacity of neural networks: effect of the fluctuations of the number of active neurons per memory
• Memory Capacities for Synaptic and Structural Plasticity
• Dynamics and Robustness of Familiarity Memory
• Neural networks and physical systems with emergent collective computational abilities.

This page was built for publication: Binary Willshaw learning yields high synaptic capacity for long-term familiarity memory