@article {46302,
	title = {Optimizing one-shot learning with binary synapses.},
	journal = {Neural Computation},
	volume = {20},
	year = {2008},
	month = {2008 Aug},
	pages = {1928-50},
	abstract = {<p>A network of excitatory synapses trained with a conservative version of Hebbian learning is used as a model for recognizing the familiarity of thousands of once-seen stimuli from those never seen before. Such networks were initially proposed for modeling memory retrieval (selective delay activity). We show that the same framework allows the incorporation of both familiarity recognition and memory retrieval, and estimate the network{\textquoteright}s capacity. In the case of binary neurons, we extend the analysis of Amit and Fusi (1994) to obtain capacity limits based on computations of signal-to-noise ratio of the field difference between selective and non-selective neurons of learned signals. We show that with fast learning (potentiation probability approximately 1), the most recently learned patterns can be retrieved in working memory (selective delay activity). A much higher number of once-seen learned patterns elicit a realistic familiarity signal in the presence of an external field. With potentiation probability much less than 1 (slow learning), memory retrieval disappears, whereas familiarity recognition capacity is maintained at a similarly high level. This analysis is corroborated in simulations. For analog neurons, where such analysis is more difficult, we simplify the capacity analysis by studying the excess number of potentiated synapses above the steady-state distribution. In this framework, we derive the optimal constraint between potentiation and depression probabilities that maximizes the capacity.</p>
},
	keywords = {Algorithms, Brain, Computer Simulation, Learning, Models, Statistical, Neural Networks (Computer), Neurons, Pattern Recognition, Automated, Synapses, Synaptic Transmission},
	issn = {0899-7667},
	doi = {10.1162/neco.2008.10-07-618},
	author = {Romani, Sandro and Amit, Daniel J and Amit, Yali}
}
