title: Markovian architectural bias of recurrent neural networks.
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 [1], [2]. 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. Index Terms-Complex symbolic sequences, information latching problem, iterative function systems, Markov models, recurrent neural networks (RNNs).
authors.affiliation: School of Computer Science, University of Birmingham, Edgbaston, Birmingham, B15 2TT, U.K. P.Tino@cs.bham.ac.uk
authors.forename: Peter
authors.initials: P
authors.lastname: Tino
authors.forename: Michal
authors.initials: M
authors.lastname: Cernanský
authors.forename: Lubica
authors.initials: L
authors.lastname: Benusková
mesh_terms: D008390:Markov Chains; D016571:Neural Networks, Computer