The Hippocampus as a Cognitive Map Computational Models of Neural - - PowerPoint PPT Presentation

the hippocampus as a cognitive map
SMART_READER_LITE
LIVE PREVIEW

The Hippocampus as a Cognitive Map Computational Models of Neural - - PowerPoint PPT Presentation

The Hippocampus as a Cognitive Map Computational Models of Neural Systems Lecture 3.6 David S. T ouretzky October, 2015 Place Cells Are Found Throughout the Hippocampal System Place cells discovered in CA1 in rats by O'Keefe and


slide-1
SLIDE 1

The Hippocampus as a Cognitive Map

Computational Models of Neural Systems

Lecture 3.6

David S. T

  • uretzky

October, 2015

slide-2
SLIDE 2

10/26/15 Computational Models of Neural Systems 2

Place Cells Are Found Throughout the Hippocampal System

  • Place cells discovered in

CA1 in rats by O'Keefe and Dostrovsky (1971)

  • Continuous fjring fjelds

with gaussian fallofg.

  • Place fjelds cover the

physical space, forming a “cognitive map” of the environment.

Sharp (2002)

John O'Keefe 2014 Nobel Laureate in Physiology or Medicine

slide-3
SLIDE 3

10/26/15 Computational Models of Neural Systems 3

The Hippocampus as a Cognitive Map

  • Psychologist E. C. T
  • lman coined the term “cognitive

map” to describe an animal's mental representation of space.

– T

  • lman, EC (1948) Cognitive maps in

rats and men.

  • Psych. Review 55(4):189-208.
  • O'Keefe and Nadel's book about place cells

drew its title from T

  • lman's phrase.

– O'Keefe, J and Nadel, L. (1978) The Hippocampus as a

Cognitive Map. Oxford University Press.

– Now online at http://www.cognitivemap.net

slide-4
SLIDE 4

10/26/15 Computational Models of Neural Systems 4

Properties of Place Fields

  • Appear instantly in a new environment, but take

10-20 minutes to fully develop.

  • Can be controlled by distal visual cues. (Rotate the

cues and the fjelds will rotate.)

  • Persist in the dark – so not dependent on visual input.

– Driven by path integration?

  • Only about 1/3 of place cells have fjelds in a typical

small environment.

  • Cells have unrelated fjelds in difgerent environments.
slide-5
SLIDE 5

10/26/15 Computational Models of Neural Systems 5

Place Fields in a Cylindrical and Square Arena

  • Roughly gaussian
  • Modest peak fjring rates (5-10 Hz)
  • Largely unrelated fjelds in the two environments

Lever et al., 2002

slide-6
SLIDE 6

6

Place Fields On A Maze

Cell 1 Cell 2

Slide courtesy of Anoopum Gupta Slide courtesy of Anoopum Gupta

slide-7
SLIDE 7

7

Neural activity during behavior

Slide courtesy of Anoopum Gupta

slide-8
SLIDE 8

8

Theta Phase Precession

Slide courtesy of Anoopum Gupta

slide-9
SLIDE 9

9

Decoded Paths

Brown et al., 1998

slide-10
SLIDE 10

10/26/15 Computational Models of Neural Systems 10

Eleanor Maguire: Spatial Memory in Humans

  • London cab drivers undergo 2-3 years of training to

learn “The Knowledge” of London's complex streets.

  • Cab drivers have larger posterior hippocampi than
  • controls. Experienced drivers show greater

enlargement than new drivers.

  • When remembering complex routes,

drivers show elevated activity in right posterior hippocampus; no increase when answering questions about historical landmarks.

slide-11
SLIDE 11

10/26/15 Computational Models of Neural Systems 11

Head Direction Cells (Ranck, 1989)

Figures from Sharp (2002)

slide-12
SLIDE 12

10/26/15 Computational Models of Neural Systems 12

Place and Head Direction Systems

Sharp (2002)

slide-13
SLIDE 13

10/26/15 Computational Models of Neural Systems 13

From (Johnston & Amaral, 1998)

PR: perirhinal cortex; POR: postrhinal cortex; EC: entorhinal cortex; PrS: presubiculum; PaS: parasubiculum; DG: dentate gyrus; CA: Cornu amonis; S: subiculum; RSP: retrosplenial cortex; Par/Oc: parietal/occipital cortex

Place cells Head direction cells

Rodent Navigation Circuit

slide-14
SLIDE 14

10/26/15 Computational Models of Neural Systems 14

Path Integration in Rodents

Mittelstaedt & Mittselstaedt (1980): gerbil pup retrieval

slide-15
SLIDE 15

10/26/15 Computational Models of Neural Systems 15

Redish & T

  • uretzky Model
  • f Rodent Navigation

Place cells learn and maintain the correspondence between local view representations and path integrator coordinates.

Redish (1997)

slide-16
SLIDE 16

10/26/15 Computational Models of Neural Systems 16

Hippocampal State: A Moving Bump of Activity

Activity packet reconstructed from fjring patterns of around 100 cells recorded simultaneously by Wilson & McNaughton (1993)

Samsonovich & McNaughton (1997)

slide-17
SLIDE 17

10/26/15 Computational Models of Neural Systems 17

2D Attractor Bump Simulation

  • In 1972, Amari, and Wilson & Cowan demonstrated

continuous attractor bumps in a recurrent network.

  • 25 years later: Samsonovich & McNaughton (1997):

2D attractor bump model of place cells.

  • Bumps are easy to simulate and visualize in MATLAB.
slide-18
SLIDE 18

10/26/15 Computational Models of Neural Systems 18

How to make a bump (1D version)

Local excitation plus global inhibition: wij = exp −i− j

2

2 

f i=max0,−wEIg∑

j

wijf j g=max0,−wIIg∑

j

wIEf j

slide-19
SLIDE 19

10/26/15 Computational Models of Neural Systems 19

How to make a bump (1D version)

Same weights for every unit (shifted):

slide-20
SLIDE 20

10/26/15 Computational Models of Neural Systems 20

Gothard et al. (1996): bump jumps

From (Gothard et al., 1996)

slide-21
SLIDE 21

10/26/15 Computational Models of Neural Systems 21

Watch the bump jump!

Cross-correlation plots of the ensemble activity patterns show a “jump” on the map as a discontinuity.

From (Gothard et al., 1996)

slide-22
SLIDE 22

10/26/15 Computational Models of Neural Systems 22

Samsonovich & McNaughton Model

Visual input Place cells Integrator cells Motor system Head direction system

  • fgset connections
slide-23
SLIDE 23

10/26/15 Computational Models of Neural Systems 23

Where is the Path Integrator?

  • Early theories (McNaughton) placed it in hippocampus.
  • Redish & T
  • uretzky: it can't go there, because multiple

maps make it too hard to update position.

  • Fyhn et al. (Science, 2004) found the PI in medial

entorhinal cortex: “grid” cells.

May-Britt and Edvard Moser, 2014 Nobel Laureates in Physiology or Medicine

slide-24
SLIDE 24

10/26/15 Computational Models of Neural Systems 24

Multiple Maps in Hippocampus

Samsonovich & McNaughton's “charts” proposal:

slide-25
SLIDE 25

How to make multiple maps (1D case)

1 3 4 5 6 7 8 9 10 11 12 13 14 15 16 6 13 9 15 1 14 11 8 16 3 2 12 10 5 4 7 2

Shuffme the units

slide-26
SLIDE 26

10/26/15 Computational Models of Neural Systems 26

Multiple Maps Can Co-Exist In An Attractor Network

Because activity patterns are sparse, the weight matrix is also sparse. Interference isn't too bad.

slide-27
SLIDE 27

10/26/15 Computational Models of Neural Systems 27

Skaggs & McNaughton (1998): Partial Remapping in Identical Environments

light

(Skaggs & McNaughton, 1998)

slide-28
SLIDE 28

10/26/15 Computational Models of Neural Systems 28

Identical Environments, Similar Fields in Both Boxes

Skaggs & McNaughton (1998), Fig. 2.

Same cell; two sessions

slide-29
SLIDE 29

10/26/15 Computational Models of Neural Systems 29

T ask-Dependent Hippocampal Remapping

Oler and Markus (2000) recorded from DG, CA3, and CA1 while animals ran either on a Figure-8 or Plus maze.

slide-30
SLIDE 30

10/26/15 Computational Models of Neural Systems 30

T ask-Dependent Remapping

Some but not all fjelds remapped depending

  • n which

task was being performed.

slide-31
SLIDE 31

10/26/15 Computational Models of Neural Systems 31

Experience-Dependent Remapping

In some circumstances, rats don't remap right away:

  • Onset may be delayed.

– So cannot be direct result of a sensory change. – Must refmect some internal change in the rat's

representation of its environment: learning.

  • Rate may be gradual.

– The time course of remapping tells us something about

the experience-dependent learning process.

  • Extent may be partial or complete.
  • What learning algorithm is reponsible for these

experience-dependent changes?

slide-32
SLIDE 32

10/26/15 Computational Models of Neural Systems 32

Bostock et al. (1991): Delayed Abrupt Complete Remapping

  • T

rain in cylinder with white card, then alternate exposure to white and black cards.

  • Most rats did not remap upon fjrst exposure to black

card.

  • But once a rat remapped, it continued to do so.

T rain Alternate

slide-33
SLIDE 33

10/26/15 Computational Models of Neural Systems 33

T anila et al. (1997): Gradual Remapping

  • Discordant responses: some cells followed local cues,

some followed distal, some remapped. The extent of remapping appeared to increase over several days. (Based on data summed over rats.)

  • Is the rat becoming more certain that the two

environments are reliably difgerent?

slide-34
SLIDE 34

10/26/15 Computational Models of Neural Systems 34

Does Remapping Matter?

  • Masters & Skaggs: remapping coincides with insight

into a task:

  • One rat quickly remapped & learned the task; one

never did. One rat didn't remap until day 11, when it suddenly “got” the task. Cause or efgect?

Brain stim. Reward location

slide-35
SLIDE 35

3 5

Theta vs Replay Sequences

Theta Replay

Occur during attentive behavior Theta oscillation is present Tied to the animal’s location Forward sequence Few neurons are active Relatively short paths represented Experience encoding and recall Occur during awake rest Sharp wave ripples present Not always tied to the animal’s location Forward or backward sequence Many neurons are often active Highly variable path lengths represented Memory consolidation, learning of cognitive maps

Slide courtesy of Anoopum Gupta

slide-36
SLIDE 36

3 6

Forward Replay

Gupta, van der Meer, T

  • uretzky, Redish, 2010
slide-37
SLIDE 37

3 7

Backward Replay

Gupta, van der Meer, T

  • uretzky, Redish, 2010
slide-38
SLIDE 38

10/26/15 Computational Models of Neural Systems 38

Confjgural Learning

  • Sutherland and Rudy suggested that hippocampus

learns complex confjgurations of cues.

  • After lesion, animals can still do tasks that depend on
  • nly one cue at a time.
  • But tasks that depend on relationships among cues are
  • impaired. Examples:

– eight-arm radial maze – Morris water maze

slide-39
SLIDE 39

10/26/15 Computational Models of Neural Systems 39

Spatial Working Memory

  • Apparatus: 8-arm radial

maze with food cups at each arm end

  • All food cups are baited

at the beginning of each trial

  • During each trial, rats

must remember which arms have already been

  • visited. A second arm

visit provides no reward.

  • Rats with hippocampal

lesions are severely impaired at this task (Neave et al., 1997)

food cups

slide-40
SLIDE 40

10/26/15 Computational Models of Neural Systems 40

Morris Water Maze

  • Large pool fjlled with milky

(opaque), cold water.

  • A submerged platform is

located at a fjxed position in the pool.

  • Distal landmarks outside

the pool are located around the room; they never move.

  • The rat is released from a

random starting position and must swim to the platform to get out of the water.

slide-41
SLIDE 41

10/26/15 Computational Models of Neural Systems 41

Morris Water Maze

Sutherland and Rudy (1988):

  • Rats with fornix lesions

can still navigate to a visible platform.

  • But they are impaired at

learning to fjnd the hidden platform.

  • Finding the hidden

platform presumably requires recognizing a confjguration of cues.

slide-42
SLIDE 42

10/26/15 Computational Models of Neural Systems 42

Morris Water Maze Revisited

  • Rats with 48 training trials prior to lesioning the

hippocampus showed no defjcit (Morris et al., 1990). Hippocampal lesion causes a learning defjcit!

  • Lesioned rats can gradually learn to fjnd a hidden

platform using successively smaller platforms (Schallert et al., 1996): Hippocampal lesions cause impairment

  • nly when learning the whole path at once!
slide-43
SLIDE 43

10/26/15 Computational Models of Neural Systems 43

Sequence Learning

slide-44
SLIDE 44

10/26/15 Computational Models of Neural Systems 44

What Does the Hippocampus Do?

  • Builds sparse random representations of

complex confjgurations of sensory and behavioral information.

  • Learns spatiotemporal associations between

these, within appropriate context, e.g., for:

– Learning paths to a goal – Learning odor sequences

  • Retains representations for later use /

consolidation.

– Replay of paths during sleep – Recall of task state after delay:

  • DMS and DNMS tasks
  • T

race conditioning