Title: ANTISYMMETRICRNN: A DYNAMICAL SYSTEM VIEW ON RECURRENT NEURAL NETWORKS

Abstract: Recurrent neural networks have gained widespread use in modeling sequential data. Learning long-term dependencies using these models remains difficult though, due to exploding or vanishing gradients. In this paper, we draw connections between recurrent networks and ordinary differential equations. A special form of recurrent networks called the AntisymmetricRNN is proposed under this theoretical framework, which is able to capture long-term dependencies thanks to the stability property of its underlying differential equation. Existing approaches to improving RNN trainability often incur significant computation overhead. In comparison, AntisymmetricRNN achieves the same goal by design. We showcase the advantage of this new architecture through extensive simulations and experiments. AntisymmetricRNN exhibits much more predictable dynamics. It outperforms regular LSTM models on tasks requiring long-term memory and matches the performance on tasks where short-term dependencies dominate despite being much simpler.

1. INTRODUCTION:

Recurrent neural networks (RNNs) (Rumelhart et al., 1986; Elman, 1990) have found widespread use across a variety of domains from language modeling (Mikolov et al., 2010; Kiros et al., 2015; Jozefowicz et al., 2016) and machine translation (Bahdanau et al., 2014) to speech recognition (Graves et al., 2013) and recommendation systems (Hidasi et al., 2015; Wu et al., 2017) . Modeling complex temporal dependencies in sequential data using RNNs, especially the long-term dependencies, remains an open challenge. The main difficulty arises as the error signal back-propagated through time (BPTT) suffers from exponential growth or decay, a dilemma commonly referred to as exploding or vanishing gradient (Pascanu et al., 2012; Bengio et al., 1994) .

Vanilla RNNs as originally proposed are particularly prone to these issues and are rarely used in practice. Gated variants of RNNs, such as long short-term memory (LSTM) networks (Hochreiter & Schmidhuber, 1997) and gated recurrent units (GRU) (Cho et al., 2014 ) that feature various forms of "gating" are proposed to alleviate these issues. The gates allow information to flow from inputs at any previous time steps to the end of the sequence more easily, partially addressing the vanishing gradient problem (Collins et al., 2016) . In practice, these models must be paired with techniques such as normalization layers (Ioffe & Szegedy, 2015; Ba et al., 2016) and gradient clipping (Pascanu et al., 2013) to achieve good performance.

Identity and orthogonal initialization is another proposed solution to the exploding or vanishing gradient problem of deep neural networks (Le et al., 2015; Mishkin & Matas, 2015; Saxe et al., 2013; Chen et al., 2018a) . Recently, Arjovsky et al. (2016) ; Wisdom et al. (2016) ; Hyland & Rätsch (2017) ; Xie et al. (2017) ; Zhang et al. (2018a) advocate going beyond initialization and forcing the weight matrices to be orthogonal throughout the entire learning process. However, some of these approaches come with significant computational overhead and reportedly hinder representation power of these models (Vorontsov et al., 2017) . Moreover, orthogonal weight matrices alone do not prevent exploding and vanishing gradients, due to the nonlinear nature of deep neural networks as shown in (Pennington et al., 2017) .

Here we offer a new perspective on the trainability of RNNs from the dynamical system viewpoint. While exploding gradient is a manifestation of the instability of the underlying dynamical system, vanishing gradient results from a lossy system, properties that have been widely studied in the dynamical system literature (Haber & Ruthotto, 2017; Laurent & von Brecht, 2017) . The main contributions of the work are:

• We draw connections between RNNs and the ordinary differential equation theory and design new recurrent architectures by discretizing ODEs.

• The stability of the ODE solutions and the numerical methods for solving ODEs lead us to design a special form of RNNs, which we name AntisymmetricRNN, that can capture longterm dependencies in the inputs. The construction of the model is much simpler compared to the existing methods for improving RNN trainability.

• We conduct extensive simulations and experiments to demonstrate the benefits of this new RNN architecture. AntisymmetricRNN exhibits well-behaved dynamics and outperforms the regular LSTM model on tasks requiring long-term memory, and matches its performance on tasks where short-term dependencies dominate with much fewer parameters.

2. RELATED WORK:

Trainability of RNNs. Capturing long-term dependencies using RNNs has been a long-standing research topic with various approaches proposed. The first group of approaches mitigates the exploding or vanishing gradient issues by introducing some forms of gating. Long short-term memory networks (LSTM) (Hochreiter & Schmidhuber, 1997) and gated recurrent units (GRU) (Cho et al., 2014) are the most prominent models along this line of work. Parallel efforts include designing special neural architectures, such as hierarchical RNNs (El Hihi & Bengio, 1996) , recursive neural networks (Socher et al., 2011) , attention networks (Bahdanau et al., 2014) , dilated convolutions (Yu & Koltun, 2015) , recurrent batch normalization (Cooijmans et al., 2017) , residual RNNs (Yue et al., 2018) , and Fourier recurrent units (Zhang et al., 2018b) . These, however, are fundamentally different networks with different tradeoffs.

Another direction is to constrain the weight matrices of an RNN so that the back-propagated error signal is well conditioned, in particular, the input-output Jacobian having unitary singular values. Le et al. (2015) ; Mikolov et al. (2014) ; Mishkin & Matas (2015) propose the use of identity or orthogonal matrix to initialize the recurrent weight matrix. Followup works further constrain the weight matrix throughout the entire learning process either through re-parametrization (Arjovsky et al., 2016) , geodesic gradient descent on the Stiefel manifold (Wisdom et al., 2016; Vorontsov et al., 2017) , or constraining the singular values (Jose et al., 2017; Kanai et al., 2017; Zhang et al., 2018a) . It is worth noting that, orthogonal weights by themselves do not guarantee unitary Jacobians. Nonlinear activations still cause the gradients to explode or vanish. Contractive maps such as sigmoid and hyperbolic tangent lead to vanishing gradients. Chen et al. (2018a) offer an initialization scheme taking into account the nonlinearity. However, the theory developed relies heavily on the random matrix assumptions, which only hold at the initialization point of training. Although it has been shown to predict trainability beyond initialization.

Dynamical systems view of recurrent networks. Connections between dynamical systems and RNNs have not been well explored. Laurent & von Brecht (2017) (He et al., 2016) . Haber & Ruthotto (2017) ; Chang et al. (2018a; b) ; Lu et al. (2018) propose to interpret ResNets as ordinary differential equations (ODEs), under which learning the network parameters is equivalent to solve a parameter estimation problem involving the ODE. Chen et al. (2018b) parameterize the continuous dynamics of hidden units using an ODE specified by a neural network. Stable and reversible architectures are developed (Haber & Ruthotto, 2017; Chang et al., 2018a) from this viewpoint, which form the basis of our proposed recurrent networks.

3. ANTISYMMETRICRNNS:



3.1. ORDINARY DIFFERENTIAL EQUATIONS:

We first give a brief overview of the ordinary differential equations (ODEs), a special kind of dynamical systems that involves a single variable, time t in this case. Consider the first-order ODE

EQUATION

for time t ≥ 0, where h(t) ∈ R n and f : R n → R n . Together with a given initial condition h(0), the problem of solving for the function h(t) is called the initial value problem. For most ODEs, it is impossible to find an analytic solution. Instead, numerical methods relying on discretization are commonly used to approximate the solution. The forward Euler method is probably the best known and simplest numerical method for approximation. One way to derive the forward Euler method is to approximate the derivative on the left-hand side of Equation 1 by a finite difference, and evaluate the right-hand side at h t-1 :

EQUATION

Note that for the approximation to be valid, > 0 should be small by the definition of the derivative.

One can easily prove that the forward Euler method converges linearly w.r.t. , assuming f (h) is Lipschitz continuous on h and that the eigenvalues of the Jacobian of f have negative real parts.

Rearranging it, we have the forward Euler method for a given initial value

EQUATION

Geometrically, each forward Euler step takes a small step along the tangential direction to the exact trajectory starting at h t-1 . As a result, is usually referred to as the step size.

As an example, consider the ODE

h (t) = tanh (W h(t)) .

The forward Euler method approximates the solution to the ODE iteratively as

h t = h t-1 + tanh(W h t-1 ),

which can be regarded as a recurrent network without input data. Here h t is the hidden state at the t-th step, W is a model parameter, and is a hyperparameter. This provides a general framework of designing recurrent network architectures by discretizing ODEs. As a result, we can design ODEs that possess desirable properties by exploiting the theoretical successes of dynamical systems, and the resulting recurrent networks will inherit these properties. Stability is one of the important properties to consider, which we will discuss in the next section. It is worth mentioning that the "skip connection" in this architecture resembles the residual RNN (Yue et al., 2018) and the Fourier RNN (Zhang et al., 2018b) , which are proposed to mitigate the vanishing and exploding gradient issues.

3.2. STABILITY OF ORDINARY DIFFERENTIAL EQUATIONS: ANTISYMMETRICRNNS:

In numerical analysis, stability theory addresses the stability of solutions of ODEs under small perturbations of initial conditions. In this section, we are going to establish the connections between the stability of an ODE and the trainability of the RNNs by discretizing the ODE, and design a new RNN architecture that is stable and capable of capturing long-term dependencies.

An ODE solution is stable if the long-term behavior of the system does not depend significantly on the initial conditions. A formal definition is given as follows.

Definition 1. (Stability) A solution h(t) of the ODE in Equation 1 with initial condition h(0) is stable if for any > 0, there exists a δ > 0 such that any other solution h(t) of the ODE with initial condition h(0) satisfying |h(0) -h(0)| ≤ δ also satisfies |h(t) -h(t)| ≤ , for all t ≥ 0.

In plain language, given a small perturbation of size δ of the initial state, the effect of the perturbation on the subsequent states is no bigger than . The eigenvalues of the Jacobian matrix play a central role in stability analysis. Let J (t) ∈ R n×n be the Jacobian matrix of f , and λ i (•) denotes the i-th eigenvalue.

Proposition 1. The solution of an ODE is stable if

EQUATION

where Re(•) denotes the real part of a complex number.

A more precise proposition that involves the kinematic eigenvalues of J (t) is given in Ascher et al. (1994) . Stability alone, however, does not suffice to capture long-term dependencies. As argued in Haber & Ruthotto (2017) , Re(λ i (J (t))) 0 results in a lossy system; the energy or signal in the initial state is dissipated over time. Using such an ODE as the underlying dynamical system of a recurrent network will lead to catastrophic forgetting of the past inputs during the forward propagation. Ideally,

EQUATION

a condition we referred to as the critical criterion. Under this condition, the system preserves the long-term dependencies of the inputs while being stable.

Stability and Trainability.:

Here we connect the stability of the ODE to the trainability of the RNN produced by discretization. Inherently, the stability analysis studies the sensitivity of a solution, i.e., how much a solution of the ODE would change w.r.t. changes in the initial condition. Differentiating Equation 1 with respect to the initial state h(0) on both sides, we have the following sensitivity analysis (with chain rules):

EQUATION

For notational simplicity, let us define A(t) = ∂h(t)/∂h(0), then we have

EQUATION

Note that this is a linear ODE with solution A(t) = e J•t = P e Λ(J)t P -1 , assuming the Jacobian J does not vary or vary slowly over time (We will later show this is a valid assumption). Here Λ(J ) denotes the eigenvalues of J , and the columns of P are the corresponding eigenvectors. See Appendix A for a more detailed derivation. In the language of RNNs, A(t) is the Jacobian of a hidden state h t with respect to the initial hidden state h 0 . When the critical criterion is met, i.e., Re(Λ(J )) ≈ 0, the magnitude of A(t) is approximately constant in time, thus no exploding or vanishing gradient problems.

With the connection established, we next design ODEs that satisfy the critical criterion. An antisymmetric matrix is a square matrix whose transpose equals its negative; i.e., a matrix M ∈ R n×n is antisymmetric if M T = -M . An interesting property of an antisymmetric matrix M is that, the eigenvalues of M are all imaginary:

Re(λ i (M )) = 0, ∀i = 1, 2, . . . , n,

making antisymmetric matrices a suitable building block of a stable recurrent architecture.

Consider the following ODE

EQUATION

where

h(t) ∈ R n , x(t) ∈ R m , W h ∈ R n×n , V h ∈ R n×m and b h ∈ R n . Note that W h -W T

h is an antisymmetric matrix. The Jacobian matrix of the right hand side is

EQUATION

whose eigenvalues are all imaginary, i.e., Re(λ i (J (t))) = 0, ∀i = 1, 2, . . . , n. In other words, it satisfies the critical criterion in Equation 5. See Appendix B for a proof. The entries of the diagonal matrix in Equation 9 are the derivatives of the activation function, which are bounded in [0, 1] for sigmoid and hyperbolic tangent. In other words, the Jacobian matrix J (t) changes smoothly over time. Furthermore, since the input and bias term only affect the bounded diagonal matrix, their effect on the stability of the ODE is insignificant compared with the antisymmetric matrix.

A naive forward Euler discretization of the ODE in Equation 8 leads to the following recurrent network we refer to as the AntisymmetricRNN.

EQUATION

where h t ∈ R n is the hidden state at time t; x t ∈ R m is the input at time t; W h ∈ R n×n , V h ∈ R n×m and b h ∈ R n are the parameters of the network; > 0 is a hyperparameter that represents the step size.

Note that the antisymmetric matrix W h -W T h only has n(n -1)/2 degrees of freedom. When implementing the model, W h can be parameterized as a strictly upper triangular matrix, i.e., an upper triangular matrix of which the diagonal entries are all zero. This makes the proposed model more parameter efficient than an unstructured RNN model of the same size of hidden states.

3.3. STABILITY OF THE FORWARD EULER METHOD: DIFFUSION:

Given a stable ODE, its forward Euler discretization can still be unstable, as illustrated in Section 4. The stability condition of the forward Euler method has been well studied and summarized in the following proposition. Proposition 2. (Stability of the forward Euler method) The forward propagation in Equation 10 is stable if max i=1,2,...,n

EQUATION

where | • | denote the absolute value or modulus of a complex number and J t is the Jacobian matrix evaluated at h t .

See Ascher & Petzold (1998) for a proof. The ODE as defined in Equation 8 is however incompatible with the stability condition of the forward Euler method. Since λ i (J t ), the eigenvalues of the Jacobian matrix, are all imaginary, |1 + λ i (J t )| is always greater than 1, which makes the AntisymmetricRNN defined in Equation 10 unstable when solved using forward Euler.

One easy way to fix it is to add diffusion to the system by subtracting a small number γ > 0 from the diagonal elements of the transition matrix. The model thus becomes

EQUATION

)

where I is the identity matrix of size n and γ > 0 is a hyperparameter that controls the strength of diffusion. By doing so, the eigenvalues of the Jacobian have slightly negative real parts. This modification improves the stability of the numerical method as demonstrated in Section 4.

3.4. GATING MECHANISM:

Gating is commonly employed in RNNs. Each gate is often modeled as a single layer network taking the previous hidden state h t-1 and data x t as inputs, followed by a sigmoid activation.

As an example, LSTM cells make use of three gates, a forget gate, an input gate, and an output gate. A systematic ablation study suggests that some of the gates are crucial to the performance of LSTM (Jozefowicz et al., 2015) .

Gating can be incorporated into AntisymmetricRNN as well. However, it should be done carefully so that the critical condition in Equation 5still holds. We propose the following modification to AntisymmetricRNN, which adds an input gate z t to control the flow of information into the hidden states:

EQUATION

where σ denotes the sigmoid function and • denotes the Hadamard product.

The effect of z t resembles the input gate in LSTM and the update gate in GRU. By sharing the antisymmetric weight matrix, the number of model parameters only increases slightly, instead of being doubled. More importantly, the Jacobian matrix of this gated model has a similar form as that in Equation 9, that is, a diagonal matrix multiplied by an antisymmetric matrix (ignoring diffusion).

As a result, the real parts of the eigenvalues of the Jacobian matrix are still close to zero, and the critical criterion remains satisfied. vanilla:

4. SIMULATION:

h t = tanh(W h t-1 ), feedback: h t = h t-1 + tanh(W h t-1 ).

Here h t ∈ R 2 and 1 ≤ t ≤ T . We arbitrarily choose three initial states: (0, 0.5), (-0.5, -0.5) and (0.5, -0.75), and apply the corresponding RNN recurrence. Figure 1 (c) and (d) correspond to orthogonal weight matrices that represent reflection and rotation transforms respectively. A two-dimensional orthogonal matrix is either a reflection or a rotation transform; the determinant of the matrix is 1 or -1 respectively. Even though the weight matrix is orthogonal, the states all converge to the origin because of the derivative of the activation function 0 ≤ tanh (W h t-1 ) ≤ 1.

In the case of RNNs with feedback, the trajectory of the hidden states is predictable based on the eigenvalues of the weight matrix W .We consider the following four weight matrices that correspond to Figure 1 (e)-(f) respectively:

W + = 2 -2 0 2 , W -= -2 2 0 -2 , W 0 = 0 -2 2 0 , W diff = -0.15 -2 2 -0.15 .

We also overlay the vector field that represents the underlying ODE. The step size is set to = 0.1.

For Figure 1 (e) and (f), the eigenvalues are

λ 1 (W + ) = λ 2 (W + ) = 2 and λ 1 (W -) = λ 2 (W -) = -2.

As a result, the hidden states are moving away from the origin and towards the origin respectively. Figure 1 (g) corresponds to the antisymmetric weight matrix W 0 , whose eigenvalues are purely imaginary:

λ 1 (W 0 ) = 2i, λ 2 (W 0 ) = -2i.

In this case, the vector field is circular; a state moves around the origin without exponentially increasing or decreasing its norm. However, on closer inspection, the trajectories are actually outward spirals. This is because, at each time step, the state moves along the tangential direction by a small step, which increases the distance from the origin and leads to numerical instability. It is the behavior characterized by Proposition 2. This issue can be mitigated by subtracting a small diffusion term γ from the diagonal elements of the weight matrix. We choose γ = 0.15 and the weight matrix

W diff has eigenvalues of λ 1 (W diff ) = -0.15 + 2i, λ 2 (W diff ) = -0.15 -2i. Figure 1(h)

shows the effect of the diffusion terms. The vector field is slightly tilting toward the origin and the trajectory maintains a constant distance from the origin.

These simulations show that the hidden states of an AntisymmetricRNN (Figure 1 (g) and (h)) have predictable dynamics. It achieves the desirable behavior, without the complication of maintaining an orthogonal or unitary matrix as in Figure 1 (d), which still suffers from vanishing gradients due to the contraction of the activation function.

5. EXPERIMENTS:

The performance of the proposed antisymmetric networks is evaluated on four image classification tasks with long-range dependencies. The classification is done by feeding pixels of the images as a sequence to RNNs and sending the last hidden state h T of the RNNs into a fully-connected layer and a softmax function. We use the cross-entropy loss and SGD with momentum and Adagrad (Duchi et al., 2011) as optimizers. More experimental details can be found in Appendix C. In this section, AntisymmetricRNN denotes the model with diffusion in Equation 12, and AntisymmetricRNN w/ gating represents the model in Equation 13.

5.1. PIXEL-BY-PIXEL MNIST:

In the first task, we learn to classify the MNIST digits by pixels (LeCun et al., 1998) . This task was proposed by Le et al. (2015) and used as a benchmark for learning long term dependencies. MNIST images are grayscale with 28 × 28 pixels. The 784 pixels are presented sequentially to the recurrent net, one pixel at a time in scanline order (starting at the top left corner of the image and ending at the bottom right corner). In other words, the input dimension m = 1 and number of time steps T = 784. The pixel-by-pixel MNIST task is to predict the digit of the MNIST image after seeing all 784 pixels. As a result, the network has to be able to learn the long-range dependencies in order to correctly classify the digit. To make the task even harder, the MNIST pixels are shuffled using a fixed random permutation. It creates non-local long-range dependencies among pixels in an image. This task is referred to as the permuted pixel-by-pixel MNIST.

method MNIST pMNIST # units # params LSTM (Arjovsky et al., 2016) 1 97.3% 92.6% 128 68k FC uRNN (Wisdom et al., 2016) 92.8% 92.1% 116 16k FC uRNN (Wisdom et al., 2016) 96.9% 94.1% 512 270k Soft orthogonal (Vorontsov et al., 2017) 94.1% 91.4% 128 18k KRU (Jose et al., 2017) 96 Table 1 : Evaluation accuracy on pixel-by-pixel MNIST and permuted MNIST.

Table 1 summarizes the performance of our methods and the existing methods. On both tasks, the proposed AntisymmetricRNNs outperform the regular LSTM model using only 1/7 of parameters. Imposing orthogonal weights (Arjovsky et al., 2016) produces worse results, which corroborates with the existing study showing that such constraints restrict the capacity of the learned model. Softening the orthogonal weights constraints (Wisdom et al., 2016; Vorontsov et al., 2017; Jose et al., 2017) leads to slightly improved performance. AntisymmetricRNNs outperform these methods by a large margin, without the computational overhead to enforce orthogonality.

5.2. PIXEL-BY-PIXEL CIFAR-10:

To test our methods on a larger dataset, we conduct experiments on pixel-by-pixel CIFAR-10. The CIFAR-10 dataset contains 32 × 32 colour images in 10 classes (Krizhevsky & Hinton, 2009) . Similar to pixel-by-pixel MNIST, we feed the three channels of a pixel into the model at each time step. The input dimension m = 3 and number of time steps T = 1024.

The results are shown in Table 2 : Evaluation accuracy on pixel-by-pixel CIFAR-10 and noise padded CIFAR-10.

5.3. NOISE PADDED CIFAR-10:

To introduce more long-range dependencies to the pixel-by-pixel CIFAR-10 task, we define a more challenging task call the noise padded CIFAR-10, inspired by the noise padded experiments in Chen et al. (2018a) . Instead of feeding in one pixel at one time, we input each row of a CIFAR-10 image at every time step. After the first 32 time steps, we input independent standard Gaussian noise for the remaining time steps. Since a CIFAR-10 image is of size 32 with three RGB channels, the input dimension is m = 96. The total number of time steps is set to T = 1000. In other words, only the first 32 time steps of input contain salient information, all remaining 968 time steps are merely random noise. For a model to correctly classify an input image, it has to remember the information from a long time ago. This task is conceptually more difficult than the pixel-by-pixel CIFAR-10, although the total amount of signal in the input sequence is the same. The results are shown in Table 2 . LSTM fails to train at all on this task while our proposed methods perform reasonably well with fewer parameters. 

5.4. ABLATION STUDY:

For the CIFAR-10 experiments, we have also conducted an ablation study to further demonstrate the effect of antisymmetric weight matrix. The ablation model in Table 2 refers to the model that replaces the antisymmetric weight matrices in Equation 13 with unstructured weight matrices. As shown in Table 2 , without the antisymmetric parametrization, the performance on both pixel-bypixel and noise padded CIFAR-10 is worse.

It is worth mentioning that the antisymmetric formulation is a sufficient condition of stability, not necessary. There are possibly other conditions that lead to stability as well as suggested in Chen et al. (2018a) , which could explain the modest degradation in the ablation results.

6. CONCLUSION:

In this paper, we present a new perspective on the trainability of RNNs from the dynamical system viewpoint. We draw connections between RNNs and the ordinary differential equation theory and design new recurrent architectures by discretizing ODEs. This new view opens up possibilities to exploit the computational and theoretical success from dynamical systems to understand and improve the trainability of RNNs. We also propose the AntisymmetricRNN, which is a discretization of ODEs that satisfy the critical criterion. Besides its appealing theoretical properties, our models have demonstrated competitive performance over strong recurrent baselines on a comprehensive set of benchmark tasks.

By establishing a link between recurrent networks and ordinary differential equations, we anticipate that this work will inspire future research in both communities. An important item of future work is to investigate other stable ODEs and numerical methods that lead to novel and well-conditioned recurrent architectures.

On one hand, v * D -1 v is real. On the other hand,

(v * W v) * = v * W * v = -v * W v,

where * represents conjugate transpose. It implies that v * W v is imaginary. Therefore, λ has to be imaginary. As a result, all eigenvalues of DW are imaginary.

C EXPERIMENTAL DETAILS:

Let m be the input dimension and n be the number of hidden units. The input to hidden matrices are initialized to N (0, 1/m). The hidden to hidden matrices are initialized to N (0, σ 2 w /n), where σ w is chosen from σ w ∈ {0, 1, 2, 4, 8, 16}. The bias terms are initialized to zero, except the forget gate bias of LSTM is initialized to 1, as suggested by Jozefowicz et al. (2015) . For AntisymmetricRNNs, the step size ∈ {0.01, 0.1, 1} and diffusion γ ∈ {0.001, 0.01, 0.1, 1.0}. We use SGD with momentum and Adagrad (Duchi et al., 2011) as optimizers, with batch size of 128 and learning rate chosen from {0.1, 0.2, 0.3, 0.4, 0.5, 0.75, 1}. On MNIST and pixel-by-pixel CIFAR-10, all the models are trained for 50,000 iterations. On noise padded CIFAR-10, models are trained for 10,000 iterations. We use the standard train/test split of MNIST and CIFAR-10. The performance measure is the classification accuracy evaluated on the test set.

D ADDITIONAL VISUALIZATIONS:

In this section, we present additional visualizations that are related to the simulation study in Section 4. Figure 3 and 4 show the dynamics of vanilla RNNs and AntisymmetricRNNs with standard Gaussian random weights using different seeds. These visualizations further illustrate the random behavior of a vanilla RNN and the predictable dynamics of an AntisymmetricRNN. 

:

Cooijmans et al. (2017) also report the performance of the LSTM as a baseline: 98.9% on MNIST and 90.2% on pMNIST. We decide to use the LSTM baseline reported byArjovsky et al. (2016) because it has a higher accuracy on the more challenging pMNIST task than that inCooijmans et al. (2017) (92.6% vs 90.2%).

Last one row:

33.6%, last two rows: 35.6%, last four rows: 39.6%, last eight rows: 48.3%.

Figures and Tables:

Figure 1: Visualization of the dynamics of RNNs and RNNs with feedback using different weight matrices.

Figure 1 plots the progression of the states h t of vanilla RNNs (first row) and RNNs with feedback (second row) parameterized by different transition matrices W . In each figure, more translucent points represent earlier time steps. The number of total time steps T = 50.

Figure 1(a) corresponds to a random weight matrix, where the entries are independent and standard Gaussian. The three initial points (shown in stars) converge to two fixed points on the boundary. Since the weight matrix is unstructured, the behavior is unpredictable as expected. More examples with different weight matrices are shown in Appendix D. Figure 1(b) shows the behavior of the

Figure 2: Mean and standard deviation of eigenvalues of the end-to-end Jacobian matrix in Antisym-metricRNNs with different diffusion constants and LSTMs, trained on the noise padded CIFAR-10.

Figure5shows the dynamics of AntisymmetricRNNs with independent standard Gaussian input. This shows that the dynamics become noisier compared to Figure1, but the trend remains the same.

Figure 5: Visualization of the dynamics of RNN with feedback with independent standard Gaussian input.

study the behavior of dynamical systems induced by recurrent networks, and show that LSTMs and GRUs exhibit chaotic dynamics in the absence of input data. They propose a simplified gated RNN named the chaos free network (CFN), that has non-chaotic dynamics and achieves comparable performance to LSTMs and GRUs on language modeling.Tallec & Ollivier (2018) formulate RNNs as a time-discretized version of ODE and show that time invariance leads to gate-like mechanisms in RNNs. With this formulation, the authors propose an initialization scheme by setting the initial gate bias according to the range of time dependencies to capture.Dynamical systems view of residual networks. Another line of work that is closely related to ours is the dynamical systems view on residual networks (ResNets)

Table content: <table/>

The AntisymmetricRNN performance is on par with the LSTM, and AntisymmetricRNN with gating is slightly better than LSTM, both using only about half of the parameters of the LSTM model. Further investigation shows that the task is mostly dominated by short term dependencies. LSTM can achieve about 48.3% classification accuracy by only seeing the last 8 rows of CIFAR-10 images 2 .

Table content: <table><tr><td>method</td><td colspan="4">pixel-by-pixel noise padded # units # params</td></tr><tr><td>LSTM</td><td>59.7%</td><td>11.6%</td><td>128</td><td>69k</td></tr><tr><td>Ablation model</td><td>54.6%</td><td>46.2%</td><td>196</td><td>42k</td></tr><tr><td>AntisymmetricRNN</td><td>58.7%</td><td>48.3%</td><td>256</td><td>36k</td></tr><tr><td>AntisymmetricRNN w/ gating</td><td>62.2%</td><td>54.7%</td><td>256</td><td>37k</td></tr></table>

Peer review (iclr2019):
 This is an interesting paper which proposes a novel angle on the problem of learning long-term dependencies in recurrent nets. The authors argue that most of the action should be in the imaginary part of the eigenvalues of the Jacobian J=F* of the new_state = old_state + epsilon F(old_state, input) incremental type of recurrence, while the real part should be slightly negative. If they were 0 the discrete time updates would still not be stable, so slightly negative (which leads to exponential loss of information) leads to stability while making it possible for the information decay to be pretty slow. They also propose a gated variant which sometimes works better. This is similar to earlier work based on orthogonal or unitary Jacobians of new_state = H(old_state,input) updates, since the Jacobian of H(old_state,input) = old_state + epsilon F( old_state,input) is I + epsilon F*. In this light, it is not clear why the proposed architecture would be better than the partially orthogonal / unitary variants previously proposed. My general concern with this this type of architecture is that they can store information in *cycles* (like in fig 1g, 1h) but this is a pretty strong constraint. For example, in the experiments, the authors did not apparently vary the length of the sequences (which would break the trick of using periodic attractors to store information). In practical applications this is very important. Also, all of the experiments are with classification tasks with few categories (10), i.e., requiring only storing 4 bits of information. Memorization tasks requiring to store many more bits, and with randomly varying sequence lengths, would better test the abilities of the proposed architecture.