|Appears in Collections:||Psychology Journal Articles|
|Peer Review Status:||Refereed|
|Title:||Optimal learning rules for familiarity detection|
Sterratt, David C
Willshaw, David J
van, Rossum Mark C W
|Citation:||Greve A, Sterratt DC, Donaldson D, Willshaw DJ & van Rossum MCW (2009) Optimal learning rules for familiarity detection, Biological Cybernetics, 100 (1), pp. 11-19.|
|Abstract:||It has been suggested that the mammalian memory system has both familiarity and recollection components. Recently, a high-capacity network to store familiarity has been proposed. Here we derive analytically the optimal learning rule for such a familiarity memory using a signalto- noise ratio analysis. We find that in the limit of large networks the covariance rule, known to be the optimal local, linear learning rule for pattern association, is also the optimal learning rule for familiarity discrimination. The capacity is independent of the sparseness of the patterns, as long as the patterns have a fixed number of bits set. The corresponding information capacity is 0.057 bits per synapse, less than typically found for associative networks.|
|Rights:||Published in Biological Cybernetics by Springer.; The original publication is available at www.springerlink.com|
This item is protected by original copyright
Items in the Repository are protected by copyright, with all rights reserved, unless otherwise indicated.
If you believe that any material held in STORRE infringes copyright, please contact email@example.com providing details and we will remove the Work from public display in STORRE and investigate your claim.