Recovery of unrehearsed items in connectionist models
When gradient-descent models with hidden units are retrained on a portion of a previously learned set of items, performance on both the relearned and unreleased items improves. Previous explanations of this phenomenon have not adequately distinguished recovery, which is dependent on original learning, from generalization, which is independent of original learning. Using a measure of vector similarity to track global changes in the weight State of three-layer networks, we shaw that (a) unlike in networks without hidden units, recovery occurs ill the absence of generalization in networks with hidden units, and (b) when the conditions of learning are varied, changes in the extent of recovery are reflected in changes in the extent to which the weights move back towards their values held after original learning. The implications of this work for rehabilitation studies, human relearning and models of human long-term memory are also considered.
gradient-descent models relearning memory backpropagation