首页    期刊浏览 2024年10月06日 星期日
登录注册

文章基本信息

  • 标题:Long Term Memory and the Densest K-Subgraph Problem
  • 作者:Robert Legenstein ; Wolfgang Maass ; Christos H. Papadimitriou
  • 期刊名称:LIPIcs : Leibniz International Proceedings in Informatics
  • 电子版ISSN:1868-8969
  • 出版年度:2018
  • 卷号:94
  • 页码:57:1-57:15
  • DOI:10.4230/LIPIcs.ITCS.2018.57
  • 出版社:Schloss Dagstuhl -- Leibniz-Zentrum fuer Informatik
  • 摘要:In a recent experiment, a cell in the human medial temporal lobe (MTL) encoding one sensory stimulus starts to also respond to a second stimulus following a combined experience associating the two. We develop a theoretical model predicting that an assembly of cells with exceptionally high synaptic intraconnectivity can emerge, in response to a particular sensory experience, to encode and abstract that experience. We also show that two such assemblies are modified to increase their intersection after a sensory event that associates the two corresponding stimuli. The main technical tools employed are random graph theory, and Bernoulli approximations. Assembly creation must overcome a computational challenge akin to the Densest K-Subgraph problem, namely selecting, from a large population of randomly and sparsely interconnected cells, a subset with exceptionally high density of interconnections. We identify three mechanisms that help achieve this feat in our model: (1) a simple two-stage randomized algorithm, and (2) the "triangle completion bias" in synaptic connectivity and a "birthday paradox", while (3) the strength of these connections is enhanced through Hebbian plasticity.
  • 关键词:Brain computation; long term memory; assemblies; association
Loading...
联系我们|关于我们|网站声明
国家哲学社会科学文献中心版权所有