Strongly Improved Stability and Faster Convergence of Temporal Sequence Learning by Using Input Correlations Only

2006 | journal article

Jump to: Cite & Linked | Documents & Media | Details | Version history

Cite this publication

​Strongly Improved Stability and Faster Convergence of Temporal Sequence Learning by Using Input Correlations Only​
Porr, B. & Woergoetter, F. ​ (2006) 
Neural Computation18(6) pp. 1380​-1412​.​ DOI: https://doi.org/10.1162/neco.2006.18.6.1380 

Documents & Media

License

GRO License GRO License

Details

Authors
Porr, Bernd; Woergoetter, Florentin 
Abstract
Currently all important, low-level, unsupervised network learning algorithms follow the paradigm of Hebb, where input and output activity are correlated to change the connection strength of a synapse. However, as a consequence, classical Hebbian learning always carries a potentially destabilizing autocorrelation term, which is due to the fact that every input is in a weighted form reflected in the neuron's output. This self-correlation can lead to positive feedback, where increasing weights will increase the output, and vice versa, which may result in divergence. This can be avoided by different strategies like weight normalization or weight saturation, which, however, can cause different problems. Consequently, in most cases, high learning rates cannot be used for Hebbian learning, leading to relatively slow convergence. Here we introduce a novel correlation-based learning rule that is related to our isotropic sequence order (ISO) learning rule (Porr & Wörgötter, 2003a), but replaces the derivative of the output in the learning rule with the derivative of the reflex input. Hence, the new rule uses input correlations only, effectively implementing strict heterosynaptic learning. This looks like a minor modification but leads to dramatically improved properties. Elimination of the output from the learning rule removes the unwanted, destabilizing autocorrelation term, allowing us to use high learning rates. As a consequence, we can mathematically show that the theoretical optimum of one-shot learning can be reached under ideal conditions with the new rule. This result is then tested against four different experimental setups, and we will show that in all of them, very few (and sometimes only one) learning experiences are needed to achieve the learning goal. As a consequence, the new learning rule is up to 100 times faster and in general more stable than ISO learning.
Issue Date
2006
Journal
Neural Computation 
ISSN
0899-7667
Language
English

Reference

Citations


Social Media