Gated recurrent unit

Template:Short description Template:Machine learning Gated recurrent units (GRUs) are a gating mechanism in recurrent neural networks, introduced in 2014 by Kyunghyun Cho et al. The GRU is like a long short-term memory (LSTM) with a gating mechanism to input or forget certain features, but lacks a context vector or output gate, resulting in fewer parameters than LSTM. GRU's performance on certain tasks of polyphonic music modeling, speech signal modeling and natural language processing was found to be similar to that of LSTM. GRUs showed that gating is indeed helpful in general, and Bengio's team came to no concrete conclusion on which of the two gating units was better.

Architecture

There are several variations on the full gated unit, with gating done using the previous hidden state and the bias in various combinations, and a simplified form called minimal gated unit.

The operator $\odot$ denotes the Hadamard product in the following.

Fully gated unit

Gated Recurrent Unit, fully gated version

Initially, for $t=0$, the output vector is $h_0=0$.

$\begin{array}{cc}{z}_t& =\sigma (W_z{x}_t+U_z{h}_{t-1}+b_z)\\ r_t& =\sigma (W_r{x}_t+U_r{h}_{t-1}+b_r)\\ {\hat{h}}_t& =\varphi (W_h{x}_t+U_h(r_t\odot h_{t-1})+b_h)\\ h_t& =(1-z_t)\odot h_{t-1}+z_t\odot {\hat{h}}_t\end{array}$

Variables ($d$ denotes the number of input features and $e$ the number of output features):

• $x_t\in {ℝ}^d$: input vector
• $h_t\in {ℝ}^e$: output vector
• ${\hat{h}}_t\in {ℝ}^e$: candidate activation vector
• $z_t\in (0,1{)}^e$: update gate vector
• $r_t\in (0,1{)}^e$: reset gate vector
• $W\in {ℝ}^{e\times d}$, $U\in {ℝ}^{e\times e}$ and $b\in {ℝ}^e$: parameter matrices and vector which need to be learned during training

Activation functions

• $\sigma$: The original is a logistic function.
• $\varphi$: The original is a hyperbolic tangent.

Alternative activation functions are possible, provided that $\sigma (x)\in [0,1]$.

Type 1

Type 2

Type 3

Alternate forms can be created by changing $z_t$ and $r_t$

• Type 1, each gate depends only on the previous hidden state and the bias.

  $\begin{array}{cc}{z}_t& =\sigma (U_z{h}_{t-1}+b_z)\\ r_t& =\sigma (U_r{h}_{t-1}+b_r)\\ \end{array}$

• Type 2, each gate depends only on the previous hidden state.

  $\begin{array}{cc}{z}_t& =\sigma (U_z{h}_{t-1})\\ r_t& =\sigma (U_r{h}_{t-1})\\ \end{array}$

• Type 3, each gate is computed using only the bias.

  $\begin{array}{cc}{z}_t& =\sigma (b_z)\\ r_t& =\sigma (b_r)\\ \end{array}$

Minimal gated unit

The minimal gated unit (MGU) is similar to the fully gated unit, except the update and reset gate vector is merged into a forget gate. This also implies that the equation for the output vector must be changed:

$\begin{array}{cc}{f}_t& =\sigma (W_f{x}_t+U_f{h}_{t-1}+b_f)\\ {\hat{h}}_t& =\varphi (W_h{x}_t+U_h(f_t\odot h_{t-1})+b_h)\\ h_t& =(1-f_t)\odot h_{t-1}+f_t\odot {\hat{h}}_t\end{array}$

Variables

• $x_t$: input vector
• $h_t$: output vector
• ${\hat{h}}_t$: candidate activation vector
• $f_t$: forget vector
• $W$, $U$ and $b$: parameter matrices and vector

Light gated recurrent unit

The light gated recurrent unit (LiGRU) removes the reset gate altogether, replaces tanh with the ReLU activation, and applies batch normalization (BN):

$\begin{array}{cc}{z}_t& =\sigma (\mathrm{BN}(W_z{x}_t)+U_z{h}_{t-1})\\ {\tilde{h}}_t& =\mathrm{ReLU}(\mathrm{BN}(W_h{x}_t)+U_h{h}_{t-1})\\ h_t& =z_t\odot h_{t-1}+(1-z_t)\odot {\tilde{h}}_t\end{array}$

LiGRU has been studied from a Bayesian perspective. This analysis yielded a variant called light Bayesian recurrent unit (LiBRU), which showed slight improvements over the LiGRU on speech recognition tasks.