ResLSTMCell
RecurrentLayers.ResLSTMCell — Type
ResLSTMCell(input_size => hidden_size;
memory_size = hidden_size,
init_kernel = glorot_uniform,
init_recurrent_kernel = glorot_uniform,
init_peephole_kernel = glorot_uniform,
init_projection_kernel = glorot_uniform,
init_residual_kernel = glorot_uniform,
bias = true, recurrent_bias = true, peephole_bias = true,
independent_recurrence = false, integration_mode = :addition)Residual long short-term memory cell (Kim et al., 2017). See ResLSTM for a layer that processes entire sequences.
Arguments
input_size => hidden_size: input and output dimension of the layer.
Keyword arguments
memory_size: internal memory cell dimension. Default ishidden_size.init_kernel: initializer for the input to hidden weights. Default isglorot_uniform.init_recurrent_kernel: initializer for the hidden to hidden weights. Default isglorot_uniform.init_peephole_kernel: initializer for the peephole weights. Default isglorot_uniform.init_projection_kernel: initializer for the cell output projection weights. Default isglorot_uniform.init_residual_kernel: initializer for the residual projection weights. Default isglorot_uniform.bias: include input to recurrent bias or not. Default istrue.recurrent_bias: include recurrent to recurrent bias or not. Default istrue.peephole_bias: include peephole to recurrent bias or not. Default istrue.independent_recurrence: flag to toggle independent recurrence. Iftrue, the recurrent to recurrent weights are a vector instead of a matrix. Defaultfalse.integration_mode: determines how the input and hidden projections are combined. The options are:additionand:multiplicative_integration. Defaults to:addition.
Equations
\[\begin{aligned} \mathbf{i}(t) &= \sigma\left( \mathbf{W}^{i}_{ih} \mathbf{x}(t) + \mathbf{W}^{i}_{hh} \mathbf{h}(t-1) + \mathbf{p}^{i} \odot \mathbf{c}(t-1) + \mathbf{b}^{i} \right), \\ \mathbf{f}(t) &= \sigma\left( \mathbf{W}^{f}_{ih} \mathbf{x}(t) + \mathbf{W}^{f}_{hh} \mathbf{h}(t-1) + \mathbf{p}^{f} \odot \mathbf{c}(t-1) + \mathbf{b}^{f} \right), \\ \mathbf{g}(t) &= \tanh\left( \mathbf{W}^{g}_{ih} \mathbf{x}(t) + \mathbf{W}^{g}_{hh} \mathbf{h}(t-1) + \mathbf{b}^{g} \right), \\ \mathbf{c}(t) &= \mathbf{f}(t) \odot \mathbf{c}(t-1) + \mathbf{i}(t) \odot \mathbf{g}(t), \\ \mathbf{o}(t) &= \sigma\left( \mathbf{W}^{o}_{ih} \mathbf{x}(t) + \mathbf{W}^{o}_{hh} \mathbf{h}(t-1) + \mathbf{W}^{o}_{ch} \mathbf{c}(t) + \mathbf{b}^{o} \right), \\ \mathbf{m}(t) &= \mathbf{W}_{p} \tanh\left( \mathbf{c}(t) \right), \\ \mathbf{h}(t) &= \mathbf{o}(t) \odot \left( \mathbf{m}(t) + \mathbf{W}_{r} \mathbf{x}(t) \right) \end{aligned}\]
Forward
reslstmcell(inp, (state, cstate))
reslstmcell(inp)Arguments
inp: The input to the reslstmcell. It should be a vector of sizeinput_sizeor a matrix of sizeinput_size x batch_size.(state, cstate): A tuple containing the hidden and cell states of the ResLSTMCell.stateshould be a vector of sizehidden_sizeor a matrix of sizehidden_size x batch_size;cstateshould be a vector of sizememory_sizeor a matrix of sizememory_size x batch_size. If not provided, they are assumed to be vectors of zeros, initialized byFlux.initialstates.
Returns
- A tuple
(output, state), whereoutput = new_stateis the new hidden state andstate = (new_state, new_cstate)is the new hidden and cell state.new_statehas sizehidden_sizeorhidden_size x batch_size;new_cstatehas sizememory_sizeormemory_size x batch_size.