Architectural Complexity Measures of Recurrent Neural Networks

By Saizheng Zhang, Yuhuai Wu, Tong Che, Zhouhan Lin, Roland Memisevic, Ruslan Salakhutdinov, Yoshua Bengio. 2016

164 citations recorded by the source corpus.

In this paper, we systematically analyze the connecting architectures of recurrent neural networks (RNNs). Our main contribution is twofold: first, we present a rigorous graph-theoretic framework describing the connecting architectures of RNNs in general. Second, we propose three architecture complexity measures of RNNs: (a) the recurrent depth, which captures the RNN's over-time nonlinear complexity, (b) the feedforward depth, which captures the local input-output nonlinearity (similar to the "depth" in feedforward neural networks (FNNs)), and (c) the recurrent skip coefficient which captures how rapidly the information propagates over time. We rigorously prove each measure's existence and computability. Our experimental results show that RNNs might benefit from larger recurrent depth and feedforward depth. We further demonstrate that increasing recurrent skip coefficient offers performance boosts on long term dependency problems.

Subfields: Artificial Intelligence, Electrical and Electronic Engineering, Model Architectures

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Artificial Intelligence

  1. Yoshua Bengio
  2. Quoc V. Le
  3. Sergey Levine
  4. Ruslan Salakhutdinov
  5. Mohit Bansal
  6. Aaron C. Courville
  7. Percy Liang
  8. Pieter Abbeel

In Electrical and Electronic Engineering

  1. Guoqi Li
  2. Vladlen Koltun
  3. J. Kolter
  4. Shaojie Bai
  5. Tailin Liang
  6. Yuan Xie
  7. Song Han
  8. C. John Glossner

In Model Architectures

  1. Yoshua Bengio
  2. Vladlen Koltun
  3. Shaojie Bai
  4. J. Kolter
  5. Ruslan Salakhutdinov
  6. Aaron C. Courville
  7. James R. Glass
  8. Ben Poole

Citations in the corpus