MUT1

RecurrentLayers.MUT1Type
MUT1(input_size => hidden_size;
    return_state=false,
    kwargs...)

Mutated unit 1 network [Jozefowicz2015]. See MUT1Cell for a layer that processes a single sequence.

Arguments

  • input_size => hidden_size: input and inner dimension of the layer.

Keyword arguments

  • init_kernel: initializer for the input to hidden weights. Default is glorot_uniform.
  • init_recurrent_kernel: initializer for the hidden to hidden weights. Default is glorot_uniform.
  • bias: include a bias or not. Default is true.
  • return_state: Option to return the last state together with the output. Default is false.

Equations

\[\begin{aligned} \mathbf{z}(t) &= \sigma\left( \mathbf{W}^{z}_{ih} \mathbf{x}(t) + \mathbf{b}^{z} \right), \\ \mathbf{r}(t) &= \sigma\left( \mathbf{W}^{r}_{ih} \mathbf{x}(t) + \mathbf{W}^{r}_{hh} \mathbf{h}(t) + \mathbf{b}^{r} \right), \\ \mathbf{h}(t+1) &= \left[ \tanh\left( \mathbf{W}^{h}_{hh} \left( \mathbf{r}(t) \odot \mathbf{h}(t) \right) + \tanh\left( \mathbf{W}^{h}_{ih} \mathbf{x}(t) + \mathbf{b}^{h} \right) + \mathbf{b}^{h} \right) \right] \odot \mathbf{z}(t) \\ &\quad + \mathbf{h}(t) \odot \left( 1 - \mathbf{z}(t) \right) \end{aligned}\]

Forward

mut(inp, state)
mut(inp)

Arguments

  • inp: The input to the mut. It should be a vector of size input_size x len or a matrix of size input_size x len x batch_size.
  • state: The hidden state of the MUT. If given, it is a vector of size hidden_size or a matrix of size hidden_size x batch_size. If not provided, it is assumed to be a vector of zeros, initialized by Flux.initialstates.

Returns

  • New hidden states new_states as an array of size hidden_size x len x batch_size. When return_state = true it returns a tuple of the hidden stats new_states and the last state of the iteration.
source
  • Jozefowicz2015Jozefowicz, R. et al. An Empirical Exploration of Recurrent Network Architectures. ICML 2015.