Overcoming Catastrophic Interference in Connectionist Networks Using Gram-Schmidt Orthogonalization

被引:7
|
作者
Srivastava, Vipin [1 ,2 ]
Sampath, Suchitra [2 ]
Parker, David J. [3 ]
机构
[1] Univ Hyderabad, Sch Phys, Hyderabad 500134, Andhra Pradesh, India
[2] Univ Hyderabad, Ctr Neural & Cognit Sci, Hyderabad 500134, Andhra Pradesh, India
[3] Univ Cambridge, Dept Physiol Dev & Neurosci, Cambridge, England
来源
PLOS ONE | 2014年 / 9卷 / 09期
关键词
SYNAPTIC PLASTICITY; MEMORY STORAGE; FEAR MEMORIES; MODELS; CORTEX; HIPPOCAMPUS;
D O I
10.1371/journal.pone.0105619
中图分类号
O [数理科学和化学]; P [天文学、地球科学]; Q [生物科学]; N [自然科学总论];
学科分类号
07 ; 0710 ; 09 ;
摘要
Connectionist models of memory storage have been studied for many years, and aim to provide insight into potential mechanisms of memory storage by the brain. A problem faced by these systems is that as the number of items to be stored increases across a finite set of neurons/synapses, the cumulative changes in synaptic weight eventually lead to a sudden and dramatic loss of the stored information (catastrophic interference, CI) as the previous changes in synaptic weight are effectively lost. This effect does not occur in the brain, where information loss is gradual. Various attempts have been made to overcome the effects of CI, but these generally use schemes that impose restrictions on the system or its inputs rather than allowing the system to intrinsically cope with increasing storage demands. We show here that catastrophic interference occurs as a result of interference among patterns that lead to catastrophic effects when the number of patterns stored exceeds a critical limit. However, when Gram-Schmidt orthogonalization is combined with the Hebb-Hopfield model, the model attains the ability to eliminate CI. This approach differs from previous orthogonalisation schemes used in connectionist networks which essentially reflect sparse coding of the input. Here CI is avoided in a network of a fixed size without setting limits on the rate or number of patterns encoded, and without separating encoding and retrieval, thus offering the advantage of allowing associations between incoming and stored patterns.
引用
收藏
页数:7
相关论文
共 50 条