neon.layers.recurrent.DeepBiLSTM

class neon.layers.recurrent.DeepBiLSTM(nout, init, init_inner=None, activation=None, gate_activation=None, reset_cells=False, depth=1)[source]

Bases: list

A stacked Bi-directional LSTM layer.

Parameters:
  • nout (int, tuple) – Desired size or shape of layer output
  • init (Initializer) – Initializer object to use for initializing weights
  • activation (Transform) – Activation function for the input modulation
  • reset_cells (bool) – default to be False to make the layer stateful, set to True to be stateless.
  • depth (int, optional) – Number of layers of BiRNN
__init__(nout, init, init_inner=None, activation=None, gate_activation=None, reset_cells=False, depth=1)[source]

Methods

__init__(nout, init[, init_inner, …])
append((object) -> None – append object to end)
clear(() -> None – remove all items from L)
copy(() -> list – a shallow copy of L)
count(…)
extend(…)
index((value, [start, …) Raises ValueError if the value is not present.
insert L.insert(index, object) – insert object before index
pop(…) Raises IndexError if list is empty or index is out of range.
remove(…) Raises ValueError if the value is not present.
reverse L.reverse() – reverse IN PLACE
sort((key=None[, reverse])
append(object) → None -- append object to end
clear() → None -- remove all items from L
copy() → list -- a shallow copy of L
count(value) → integer -- return number of occurrences of value
extend(iterable) → None -- extend list by appending elements from the iterable
index(value[, start[, stop]]) → integer -- return first index of value.

Raises ValueError if the value is not present.

insert()

L.insert(index, object) – insert object before index

pop([index]) → item -- remove and return item at index (default last).

Raises IndexError if list is empty or index is out of range.

remove(value) → None -- remove first occurrence of value.

Raises ValueError if the value is not present.

reverse()

L.reverse() – reverse IN PLACE

sort(key=None, reverse=False) → None -- stable sort *IN PLACE*