title: Neural associative memory with optimal Bayesian learning.
abstract: Neural associative memories are perceptron-like single-layer networks with fast synaptic learning typically storing discrete associations between pairs of neural activity patterns. Previous work optimized the memory capacity for various models of synaptic learning: linear Hopfield-type rules, the Willshaw model employing binary synapses, or the BCPNN rule of Lansner and Ekeberg, for example. Here I show that all of these previous models are limit cases of a general optimal model where synaptic learning is determined by probabilistic Bayesian considerations. Asymptotically, for large networks and very sparse neuron activity, the Bayesian model becomes identical to an inhibitory implementation of the Willshaw and BCPNN-type models. For less sparse patterns, the Bayesian model becomes identical to Hopfield-type networks employing the covariance rule. For intermediate sparseness or finite networks, the optimal Bayesian learning rule differs from the previous models and can significantly improve memory performance. I also provide a unified analytical framework to determine memory capacity at a given output noise level that links approaches based on mutual information, Hamming distance, and signal-to-noise ratio.
authors.affiliation: Honda Research Institute Europe GmbH, D-63073 Offenbach, Germany. andreas.knoblauch@honda-ri.de
authors.forename: Andreas
authors.initials: A
authors.lastname: Knoblauch
mesh_terms: D001499:Bayes Theorem; D007858:Learning / Q000502:physiology*; D011939:Mental Recall / Q000502:physiology*; D008959:Models, Neurological; D009415:Nerve Net / Q000502:physiology*; D016571:Neural Networks, Computer; D009474:Neurons / Q000502:physiology*; D013569:Synapses / Q000502:physiology