z-logo
Premium
Deforming the hippocampal map
Author(s) -
Touretzky David S.,
Weisman Wendy E.,
Fuhs Mark C.,
Skaggs William E.,
Fenton Andre A.,
Muller Robert U.
Publication year - 2005
Publication title -
hippocampus
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 1.767
H-Index - 155
eISSN - 1098-1063
pISSN - 1050-9631
DOI - 10.1002/hipo.20029
Subject(s) - landmark , artificial neural network , place cell , neuroscience , attractor , hippocampal formation , maximum likelihood , psychology , pattern recognition (psychology) , computer science , artificial intelligence , mathematics , statistics , mathematical analysis
To investigate conjoint stimulus control over place cells, Fenton et al. (J Gen Physiol 116:191–209, 2000a) recorded while rats foraged in a cylinder with 45° black and white cue cards on the wall. Card centers were 135° apart. In probe trials, the cards were rotated together or apart by 25°. Firing field centers shifted during these trials, stretching and shrinking the cognitive map. Fenton et al. (2000b) described this deformation with an ad hoc vector field equation. We consider what sorts of neural network mechanisms might be capable of accounting for their observations. In an abstract, maximum likelihood formulation, the rat's location is estimated by a conjoint probability density function of landmark positions. In an attractor neural network model, recurrent connections produce a bump of activity over a two‐dimensional array of cells; the bump's position is influenced by landmark features such as distances or bearings. If features are chosen with appropriate care, the attractor network and maximum likelihood models yield similar results, in accord with previous demonstrations that recurrent neural networks can efficiently implement maximum likelihood computations (Pouget et al. Neural Comput 10:373–401, 1998; Deneve et al. Nat Neurosci 4:826–831, 2001). © 2004 Wiley‐Liss, Inc.

This content is not available in your region!

Continue researching here.

Having issues? You can contact us here