DocumentCode :
3785117
Title :
Markovian architectural bias of recurrent neural networks
Author :
P. Tino;M. Cernansky;L. Benuskova
Author_Institution :
Sch. of Comput. Sci., Univ. of Birmingham, UK
Volume :
15
Issue :
1
fYear :
2004
Firstpage :
6
Lastpage :
15
Abstract :
In this paper, we elaborate upon the claim that clustering in the recurrent layer of recurrent neural networks (RNNs) reflects meaningful information processing states even prior to training. By concentrating on activation clusters in RNNs, while not throwing away the continuous state space network dynamics, we extract predictive models that we call neural prediction machines (NPMs). When RNNs with sigmoid activation functions are initialized with small weights (a common technique in the RNN community), the clusters of recurrent activations emerging prior to training are indeed meaningful and correspond to Markov prediction contexts. In this case, the extracted NPMs correspond to a class of Markov models, called variable memory length Markov models (VLMMs). In order to appreciate how much information has really been induced during the training, the RNN performance should always be compared with that of VLMMs and NPMs extracted before training as the "null" base models. Our arguments are supported by experiments on a chaotic symbolic sequence and a context-free language with a deep recursive structure.
Keywords :
"Recurrent neural networks","Data mining","Predictive models","State-space methods","Chaos","History","Neural networks","Information processing","Iterative algorithms","Automata"
Journal_Title :
IEEE Transactions on Neural Networks
Publisher :
ieee
ISSN :
1045-9227
Type :
jour
DOI :
10.1109/TNN.2003.820839
Filename :
1263574
Link To Document :
بازگشت