GAL: Networks That Grow When They Learn and Shrink When They Forget

TitleGAL: Networks That Grow When They Learn and Shrink When They Forget
Publication TypeTechnical Report
Year of Publication1991
AuthorsAlpaydin, E.
Other Numbers662
Keywordsclassification, constructive methods, destructive methods, growth, Incremental learning, nearest neighbor, pruning, supervised learning
Abstract

Learning when limited to modification of some parameters has a limited scope; the capability to modify the system structure is also needed to get a wider range of the learnable. In the case of artificial neural networks, learning by iterative adjustment of synaptic weights can only succeed if the network designer predefines an appropriate network structure, i.e., number of hidden layers, units, and the size and shape of their receptive and projective fields. This paper advocates the view that the network structure should not, as usually done, be determined by trial-and-error but should be computed by the learning algorithm. Incremental learning algorithms can modify the network structure by addition and/or removal of units and/or links. A survey of current connectionist literature is given on this line of thought. ``Grow and Learn'' (GAL) is a new algorithm that learns an association at one-shot due to being incremental and using a local representation. During the so-called ``sleep'' phase, units that were previously stored but which are no longer necessary due to recent modifications are removed to minimize network complexity. The incrementally constructed network can later be finetuned off-line to improve performance. Another method proposed that greatly increases recognition accuracy is to train a number of networks and vote over their responses. The algorithm and its variants are tested on recognition of handwritten numerals and seem promising especially in terms of learning speed. This makes the algorithm attractive for on-line learning tasks, e.g., in robotics. The biological plausibility of incremental learning is also discussed briefly.

URLhttp://www.icsi.berkeley.edu/ftp/global/pub/techreports/1991/tr-91-032.pdf
Bibliographic Notes

ICSI Technical Report TR-91-032

Abbreviated Authors

E. Alpaydin

ICSI Publication Type

Technical Report