word

16
word

description

word. A simple semantic network (O’Kane & Treves, 1992). updated to remove the ‘memory glass’ problem (Fulvi Mari & Treves, 1998). Reduced to a Potts model (Kropff & Treves, 2005). Cortical modules. Structured long-range connectivity. Potts units with dilute connectivity. - PowerPoint PPT Presentation

Transcript of word

Page 1: word

word

Page 2: word

Cortical modules

Local attractor states

Global activity patterns

A simple semantic network (O’Kane & Treves, 1992)

Structured long-rangeconnectivity

“0” state included

Sparse global patterns

updated to remove the‘memory glass’ problem (Fulvi Mari & Treves, 1998)

Potts units with diluteconnectivity

S+1 Potts states

Sparse Potts patterns

Reduced to a Potts model (Kropff & Treves, 2005)

..but all cortical modulesshare the same organization…

pc C S 2 !! pc S ?!?!

Page 3: word

Simulations which include a model of neuronal fatigueshow that the Potts semantic network

can hop from global attractor to global attractor:Latching dynamics

SimulationsSimulations which include a model of neuronal fatigue

Page 4: word
Page 5: word

Latching dynamics, if transition probabilities are structured,

might be a neural model for infinite recursion

Page 6: word

Monkey recordings by Moshe Abeles et al

Page 7: word

How might have a capacity for indefinite latching evolved?

pc C S 2

Storage capacity (max p to allow cued retrieval)

a spontaneous transition to infinite recursion?

+L+Lp p

SC

pl S ?

Latching onset (min p to ensure recursive process)

AM AM

long-range conn (local conn )

semantics

semantics

Page 8: word

G Elstonet al

Page 9: word
Page 10: word

determ dete

rmra

nd

rand

Latching may be a neural basis for infinite recursion only iftransition probabilities are structured,

so that dynamics are neither random not deterministic

pl S ?pc C S 2 ?

+ we need to confirm the crucial quantitative relationships,e.g. that in a multi-factor coding model (with correlated patterns)

Emilio Kropff has taken care of that (J Nat Comput, 2006)

Page 11: word

Computer simulations ofFrontal Latching Networks with

N = 300 Potts unitsa = 0.25 sparse codingS = 3,4,5,7,10 + 1 statesC = 12,17,25,50,100 connectionsp = 25-400 patternsgenerated by 20 relevant factors

How to quantify retrieval ?and latching ?

Page 12: word
Page 13: word
Page 14: word
Page 15: word
Page 16: word

Retrieval and latching appear to coexistonly above critical values of both C and S

Is that to FLNs a percolation phase transition?