White Olivia L, Lee Daniel D, Sompolinsky Haim
Harvard University, Cambridge, Massachusetts 02138, USA.
Phys Rev Lett. 2004 Apr 9;92(14):148102. doi: 10.1103/PhysRevLett.92.148102.
We study the ability of linear recurrent networks obeying discrete time dynamics to store long temporal sequences that are retrievable from the instantaneous state of the network. We calculate this temporal memory capacity for both distributed shift register and random orthogonal connectivity matrices. We show that the memory capacity of these networks scales with system size.
我们研究了遵循离散时间动态的线性递归网络存储可从网络瞬时状态检索的长时间序列的能力。我们计算了分布式移位寄存器和随机正交连接矩阵的这种时间记忆容量。我们表明，这些网络的记忆容量随系统规模而变化。
