Dynamics and robustness of familiarity memory

DOI10.1162/NECO.2009.12-08-921MaRDI QIDQ5189866zbMATH OpenOpenAlexDBLPWikidataFDO

Authors Andrea Greve, Adam B. Barrett, M. C. W. van Rossum, J. M. Cortés

Publication date 11 March 2010

Published in Neural Computation (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/0710.1333, http://sro.sussex.ac.uk/id/eprint/60440/1/9.%20familiarity.pdf

zbMATH Keywords

energyfamiliarity discriminationfamiliarity memorymean field analysisneural networknoise dependence

Mathematics Subject Classification ID

Psychophysics and psychophysiology; perception (91E30) Memory and learning in psychology (91E40) Neural biology (92C20)

Abstract: When one is presented with an item or a face, one can sometimes have a sense of recognition without being able to recall where or when one has encountered it before. This sense of recognition is known as familiarity. Following previous computational models of familiarity memory we investigate the dynamical properties of familiarity discrimination, and contrast two different familiarity discriminators: one based on the energy of the neural network, and the other based on the time derivative of the energy. We show how the familiarity signal decays after a stimulus is presented, and examine the robustness of the familiarity discriminator in the presence of random fluctuations in neural activity. For both discriminators we establish, via a combined method of signal-to-noise ratio and mean field analysis, how the maximum number of successfully discriminated stimuli depends on the noise level.

Recommendations

• A familiarity discrimination algorithm inspired by computations of the perirhinal cortex
• Optimal learning rules for familiarity detection
• Capacity of perirhinal cortex network for recognising frequently repeating stimuli
• Optimizing One-Shot Learning with Binary Synapses
• Binary Willshaw learning yields high synaptic capacity for long-term familiarity memory

Cites work

• Learning Patterns and Pattern Sequences by Self-Organizing Nets of Threshold Elements
• Modeling Brain Function
• Neural networks and physical systems with emergent collective computational abilities
• Nonequilibrium Phase Transitions in Lattice Models
• Optimal learning rules for familiarity detection

Cited in

(6)

• Capacity of perirhinal cortex network for recognising frequently repeating stimuli
• Memory effects and homogenization
• Optimal learning rules for familiarity detection
• A familiarity discrimination algorithm inspired by computations of the perirhinal cortex
• Binary Willshaw learning yields high synaptic capacity for long-term familiarity memory
• The flexibility of models of recognition memory: the case of confidence ratings

This page was built for publication: Dynamics and robustness of familiarity memory

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5189866)