Cortical hierarchies, sleep, and the extraction of knowledge from memory

被引:30
|
作者
McNaughton, Bruce L. [1 ]
机构
[1] Univ Lethbridge, Dept Neurosci, Canadian Ctr Behav Neurosci, Lethbridge, AB T1K 3M4, Canada
关键词
CORTEX; NEOCORTEX; REPLAY; MODEL; CONSOLIDATION; REACTIVATION; HIPPOCAMPUS; EXPERIENCE; DYNAMICS; SYSTEMS;
D O I
10.1016/j.artint.2009.11.013
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Odin the Allfather had in his service two great ravens. These ravens' names were Hugin (Thought) and Munin (Memory) and every morning at dawn they would fly off over Midgard (the world) in search of news and information to learn more about humans and their activities. At sundown, they would return to Odin where they would perch one on each of Odin's shoulders, and whisper into his ears all that they had seen and heard. Experience, stored in the brain as memory, is the raw material for intelligence and thought. It has been suggested that at sundown (i.e., during sleep) the brain adjusts its own synaptic matrix to enable adaptive responses to future events by a process of gradient descent optimization, involving repeated reactivations of recent and older memories and gradual adjustment of the synaptic weights. Memory retrieval, thought, and the generation of adaptive behavioral responses involve globally coordinated trajectories through the neuronal state-space, mediated by appropriate synaptic linkages. Artificial neural networks designed to implement even the most rudimentary forms of memory and knowledge extraction and adaptive behavior incorporate massively and symmetrically interconnected nodes; yet, in the cerebral cortex, the probability of a synaptic connection between any two arbitrarily chosen cells is on the order of 10(-6), i.e., so close to zero that a naive modeler might neglect this parameter altogether. The probability of a symmetric connection is even smaller (10(-12)). How then, are thought and memory even possible? The solution appears to have been in the evolution of a modular, hierarchical cortical architecture, in which the modules are internally highly connected but only weakly interconnected with other modules. Appropriate inter-modular linkages are mediated indirectly via common linkages with higher level modules collectively known as association cortex. The hippocampal formation in the temporal lobe is the highest level of association cortex. It generates sequentially coupled patterns unique to the location and content of experience, but which do not contain the actual stored data. Rather, the patterns serve as pointers or 'links' to the data. Spontaneous reactivation of these linking patterns during sleep may enable the retrieval of recent sequences of experience stored in the lower levels of the cortex and the gradual extraction of knowledge from them. In this essay I explore these ideas, their implications, and the neuroscientific evidence for them. (C) 2009 Published by Elsevier B.V.
引用
收藏
页码:205 / 214
页数:10
相关论文
共 50 条
  • [41] SEQUENTIAL PROGRAM PREFETCHING IN MEMORY HIERARCHIES
    SMITH, AJ
    COMPUTER, 1978, 11 (12) : 7 - 21
  • [42] Analysis of power consumption in memory hierarchies
    Hicks, P
    Walnock, M
    Owens, RM
    1997 INTERNATIONAL SYMPOSIUM ON LOW POWER ELECTRONICS AND DESIGN, PROCEEDINGS, 1997, : 239 - 242
  • [43] An analytical model for designing memory hierarchies
    Jacob, BL
    Chen, PM
    Silverman, SR
    Mudge, TN
    IEEE TRANSACTIONS ON COMPUTERS, 1996, 45 (10) : 1180 - 1194
  • [44] Lightweight simulation of programmable memory hierarchies
    Devai, Gergely
    ANNALES MATHEMATICAE ET INFORMATICAE, 2015, 44 : 59 - 69
  • [45] OPTIMIZATION OF MEMORY HIERARCHIES IN MULTIPROGRAMMED SYSTEMS
    RAMAMOORTHY, CV
    CHANDY, KM
    JOURNAL OF THE ACM, 1970, 17 (03) : 426 - +
  • [46] Compilation for Explicitly Managed Memory Hierarchies
    Knight, Timothy J.
    Park, Ji Young
    Ren, Manman
    Houston, Mike
    Erez, Mattan
    Fatahalian, Kayvon
    Aiken, Alex
    Dally, William J.
    Hanrahan, Pat
    PROCEEDINGS OF THE 2007 ACM SIGPLAN SYMPOSIUM ON PRINCIPLES AND PRACTICE OF PARALLEL PROGRAMMING PPOPP'07, 2007, : 226 - 236
  • [47] Memory hierarchies - Models and lower bounds
    Sanders, P
    ALGORITHMS FOR MEMORY HIERARCHIES: ADVANCED LECTURES, 2003, 2625 : 1 - 13
  • [48] The impact of memory hierarchies on cluster computing
    Du, X
    Zhang, XD
    IPPS/SPDP 1999: 13TH INTERNATIONAL PARALLEL PROCESSING SYMPOSIUM & 10TH SYMPOSIUM ON PARALLEL AND DISTRIBUTED PROCESSING, PROCEEDINGS, 1999, : 61 - 69
  • [49] Impact of memory hierarchies on cluster computing
    Univ of Virginia, Charlottesville, United States
    Proc Int Parall Process Symp IPPS, (61-69):
  • [50] Using concept hierarchies in knowledge discovery
    Di Beneditto, MEM
    de Barros, LN
    ADVANCES IN ARTIFICIAL INTELLIGENCE - SBIA 2004, 2004, 3171 : 255 - 265