arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 0707.3066cond-mat.dis-nncond-mat.other
收藏

自联想记忆中相关记忆存储的完整解

Full solution for the storage of correlated memories in an autoassociative memory

Emilio Kropff

摘要:

我们补充我们以前的工作[arxiv:0707.0565]与完整的(非稀释)的解决方案描述的吸引子网络的稳定状态,存储相关的活动模式。新的解决方案提供了一个很好的适合的模拟网络存储的功能规范的麦克雷和同事[麦克雷等人,2005年],实验获得的组合的功能表示概念的语义记忆。我们讨论了三种提高网络存储容量的方法:添加无信息神经元,删除信息神经元和引入流行度调制的赫布学习。我们表明,如果突触的强度是由突触前神经元的流行度的指数衰减调制的,则任何模式的分布都可以以近似最佳的存储容量来存储和检索-即,C ~ I.p,维持模式检索所需的每个神经元的最小连接数与模式的信息量乘以存储的模式数成比例网络中

英文摘要:

We complement our previous work [arxiv: 0707.0565] with the full (non diluted) solution describing the stable states of an attractor network that stores correlated patterns of activity. The new solution provides a good fit of simulations of a network storing the feature norms of McRae and colleagues [McRae et al, 2005], experimentally obtained combinations of features representing concepts in semantic memory. We discuss three ways to improve the storage capacity of the network: adding uninformative neurons, removing informative neurons and introducing popularity-modulated hebbian learning. We show that if the strength of synapses is modulated by an exponential decay of the popularity of the pre-synaptic neuron, any distribution of patterns can be stored and retrieved with approximately an optimal storage capacity - i.e, C ~ I.p, the minimum number of connections per neuron needed to sustain the retrieval of a pattern is proportional to the information content of the pattern multiplied by the number of patterns stored in the network.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑