6 questions. Pass with 5 correct.

  1. 01 Looking up token in an embedding matrix is equivalent to:
  2. 02 An RNN shares its weights across:
  3. 03 A gradient is multiplied by about 0.9 at each of 50 time steps. What fraction remains?
  4. 04 In an LSTM, a forget gate close to 1 means:
  5. 05 Gradient clipping is a remedy for:
  6. 06 What was the bottleneck in the original encoder-decoder RNN for translation?