ScholarMate
English简体中文繁體中文
客服热线:400-1616-289
登录注册
期刊论文

Memory capacity for sequences in a recurrent network with biological constraints

Leibold, C; Kempter, R
Neural Computation2006-4DOI: 10.1162/089976606775774714
46被引6阅读
引用收藏
分享

摘要

The CA3 region of the hippocampus is a recurrent neural network that is essential for the storage and replay of sequences of patterns that represent behavioral events. Here we present a theoretical framework to calculate a sparsely connected network's capacity to store such sequences. As in CA3, only a limited subset of neurons in the network is active at any one time, pattern retrieval is subject to error, and the resources for plasticity are limited. Our analysis combines an analytical mean field approach, stochastic dynamics, and cellular simulations of a time-discrete McCulloch-Pitts network with binary synapses. To maximize the number of sequences that can be stored in the network, we concurrently optimize the number of active neurons, that is, pattern size, and the firing threshold. We find that for one-step associations (i.e., minimal sequences), the optimal pattern size is inversely proportional to the mean connectivity c, whereas the optimal firing threshold is independent of the connectivity. If the number of synapses per neuron is fixed, the maximum number P of stored sequences in a sufficiently large, nonmodular network is independent of its number N of cells. On the other hand, if the number of synapses scales as the network size to the power of 3/2, the number of sequences P is proportional to N. In other words, sequential memory is scalable. Furthermore, we find that there is an optimal ratio r between silent and nonsilent synapses at which the storage capacity alpha = P/[c(1 + r)N] assumes a maximum. For long sequences, the capacity of sequential memory is about one order of magnitude below the capacity for minimal sequences, but otherwise behaves similar to the case of minimal sequences. In a biologically inspired scenario, the information content per synapse is far below theoretical optimality, suggesting that the brain trades off error tolerance against information content in encoding sequential memories.

学科与关键词

关键词
NEURAL-NETWORKSTEMPORAL ASSOCIATIONINFORMATION-STORAGEPLACE CELLSHIPPOCAMPUSMODELOSCILLATIONSNEURONSCOMPRESSIONMECHANISMS
相关
加载中…
  • The relationship of local context codes to sequence length memory capacity
    Levy, WB*; Wu, XBNetwork: Computation in Neural Systems , 1996, 7(2): 371-384.被引 28
  • Storage fidelity for sequence memory in the hippocampal circuit
    Bayati, Mehdi; Neher, Torsten; Melchior, Jan; Diba, Kamran; Wiskott, Laurenz; Cheng, Sen*PLoS One, 2018, 13(10): e0204685.被引 6
  • Optimal Recall from Bounded Metaplastic Synapses: Predicting Functional Adaptations in Hippocampal Area CA3
    Savin, Cristina*; Dayan, Peter; Lengyel, MatePLoS Computational Biology, 2014, 10(2).被引 16
查看全部 →

发表信息

论文状态
公开发表
期刊
Neural Computation
发表日期
2006-04
卷期
第 18 卷, 第 4 期
页码
904-941
DOI
10.1162/089976606775774714
语言
ENGLISH
成果收录
SCIE

作者

  • L

    Leibold, C (第一作者)

  • K

    Kempter, R

登录解锁更多功能

  • 收藏这篇,随时在“我的 · 收藏”找回
  • 认领你的成果,生成推广素材
  • 关注作者获取最新成果
  • 加入项目组、协同写作
注册 / 登录

产品服务

  • 科研之友
  • 创新城
  • 科创云

服务支持

  • 帮助中心
  • 隐私政策
  • 服务条款

联系方式

在线客服:【】
客服热线:400-1616-289
电子邮箱:support@scholarmate.com

关注或下载科研之友

微信二维码
微信公众号
客户端下载二维码
下载客户端
科研成果科研人员科研机构科研动态爱瑞思软件

©2026 深圳市科研之友网络服务有限公司

公安备案图标粤公网安备 44030502000213
粤ICP备 16046710 号粤B2-20110417