Is the Cortex a Digital Computer? Dana H. Ballard Department of - - PowerPoint PPT Presentation

is the cortex a digital computer
SMART_READER_LITE
LIVE PREVIEW

Is the Cortex a Digital Computer? Dana H. Ballard Department of - - PowerPoint PPT Presentation

Is the Cortex a Digital Computer? Dana H. Ballard Department of Computer Science University of Texas at Austin Austin,TX International Symposium Vision by Brains and Machines November 13th-17th Montevideo, Uruguay Computational


slide-1
SLIDE 1

Is the Cortex a Digital Computer?

Dana H. Ballard

Department of Computer Science University of Texas at Austin Austin,TX International Symposium “Vision by Brains and Machines” November 13th-17th Montevideo, Uruguay

slide-2
SLIDE 2

Computational Hierarchy

Create baseline calibrations Calibration Estimate state State Select the next thing to do within a procedure Action Choose procedural set OS Description Function

slide-3
SLIDE 3

Roelfsema et al PNAS 2003

Visual Routines

slide-4
SLIDE 4

Multi-tasking As Revealed by Gaze Sharing in Human Data

10 20 30 40 50 60 172 10

3

177 10

3

182 10

3

187 10

3

Mid-Block 40m

time(sec) Mid-block sign Car Intersection sign Eye Stop sign

0 5 10 15

Shinoda and Hayhoe, Vision Research 2001

See Neuron 1999 Special Issue

slide-5
SLIDE 5

QuickTime and a YUV420 codec decompressor are needed to see this picture.

slide-6
SLIDE 6

Temporal Rate Coding

milliseconds

slide-7
SLIDE 7

Why Rate Coding cannot work

slide-8
SLIDE 8

Why Rate Coding cannot work

slide-9
SLIDE 9

NN Hebb rule: Maximize XW Want x ~ ∆T ~ ∆W

slide-10
SLIDE 10

In a rate coding model, the position of the spike at a synapse wrt the output spike must be random

slide-11
SLIDE 11

Timing Poisson Updates Synaptic weight

slide-12
SLIDE 12

Timing Poisson Updates Synaptic weight

slide-13
SLIDE 13

A small ~ 1-2 ms delay can be used to signal an analog quantity

1 ms δ

reference

slide-14
SLIDE 14

A Rank Order Code

VanRullen & Thorpe Vision Res 2002

slide-15
SLIDE 15

Feedback Spike Timing Constraint

_ + r Loop delay = 20 milliseconds

slide-16
SLIDE 16

Computational Hierarchy

Create baseline calibrations Calibration Estimate state State Select the next thing to do within a procedure Action Choose procedural set OS Description Function

slide-17
SLIDE 17
slide-18
SLIDE 18
slide-19
SLIDE 19

LGN-V1 Circuit

  • +

U rest I U

T

e = I - Ur

LGN Cortex

r

slide-20
SLIDE 20

A Slice Through The Cortex

  • +

r

  • +

r

  • +

r LGN V1 V2

slide-21
SLIDE 21

from Usrey & Reid

slide-22
SLIDE 22

Labeled Line Math

slide-23
SLIDE 23
slide-24
SLIDE 24

NN vol8 p1552

x u β

Case 2

slide-25
SLIDE 25
slide-26
SLIDE 26

Model Experiment

Comparing the Model to Data

slide-27
SLIDE 27

Computational Hierarchy

Create baseline calibrations Calibration Estimate state State Select the next thing to do within a procedure Action Choose procedural set OS Description Function

slide-28
SLIDE 28
slide-29
SLIDE 29

See also: Computing With Self-Excitatory Cliques: A Model and an Application to Hyperacuity-Scale... Zucker and Miller, Neural Comp..1999; 11: 21-66

slide-30
SLIDE 30

500µ

Lund & Bressloff (2003) Cerebral Cortex 14

slide-31
SLIDE 31
slide-32
SLIDE 32

Reasons for copies

_

Copies exist in columns

_

Copies provide robustness to cell death

_

Copies allow mathematical exploration

_

Copies allow multiprocessing

_

Circumvent refractory period

slide-33
SLIDE 33

What would the spikes look like in such a scheme?

slide-34
SLIDE 34

Parameters

Trials ~ No. of individual experimental trials Processes ~ No. of ongoing procedures Copies ~ No. of cells with same RF Duration ~ Duration of an individual trial Jitter ~ Displacement used to signal analog value*

* Not used

slide-35
SLIDE 35

Trials =50 Processes = 2 Copies = 6 Duration =1 sec

Distributed Synchrony Simulation m σ

slide-36
SLIDE 36

Poisson Process m σ

slide-37
SLIDE 37

Raj Rao Zuohua Zhang Johnathan Shaw Constantin Rothkopf Janneke Jehee

slide-38
SLIDE 38

Computation Neuroscience Physics

slide-39
SLIDE 39

Axonal Propagation Speeds: Evidence? 2-6 cm/s

0.1 - 0.4 cm/s

slide-40
SLIDE 40

Code input I with synapses U and

  • utput r

Coding cost of residual error Coding Cost of model [Olshausen and Field 1997]

Min E(U,r) = |I-Ur|2 + F(r) + G(U)

U,r

slide-41
SLIDE 41

Synapses are Trained with Natural Images

Dr µ- ¶ E ¶ r

DU µ- ¶ E ¶ U

  • 1. Apply Image
  • 2. Change firing
  • 3. Change Synapses

Min E(U,r) = |I-Ur|2 + F(r) + G(U)

slide-42
SLIDE 42

Handling the Error Term with Predictive Coding

I=u1r1u2r 2...um r m

I r1 r2 LGN Cortex

I

r

  • +

U

slide-43
SLIDE 43

Sparse Priors are Biological

slide-44
SLIDE 44

A Slice Through The Cortex

  • +

r

  • +

r

  • +

r LGN V1 V2

X

slide-45
SLIDE 45

Rao and Ballard, Nature Neuroscience 1999

RF

Endstopping

slide-46
SLIDE 46

Drawbacks of rate coding

_

Inherent inaccuracy with signaling with a probabilistic code

_

Averaging over populations is expensive

_

Unary codes are inefficient

_

Its never used in simulations

_

Decoders are of marginal utility

_

Ubiquitous observation of Poisson statistics

_

Rate coding is incompatible with the Hebb Rule (Bi & Poo)

slide-47
SLIDE 47
  • C. Reid et al
  • M. Meister et al

Retina LGN