Ikibazo gihuza ibibazo · Hagati Urwego

Amarembo Yisubiramo Ibibazo

Ikizamini amarembo ya GRU, guhisha-leta ivugurura, gusubiramo imyitwarire, itandukaniro rya LSTM, leta zabakandida, nimbibi zo kugereranya imyubakire.

Inzira zijyanye no kuyoboraAmarembo Yisubiramo
Ikibazo 1 Bya 8

How many gates does the GRU cell in the guide use?

Reba buri kibazo8 ibibazo

Ibisubizo nibisobanuro bigaragara mugihe ufata ikibazo.

  1. How many gates does the GRU cell in the guide use?
    • Two: an update gate and a reset gate
    • Three plus a separate cell state
    • One gate per sequence position
    • No gates
  2. Icyo gate y'ihindurwa (update gate) igenzura ni iki?
    • Which input token is removed permanently
    • The number of sequence layers
    • Whether to compute a separate cell state
    • How much of the previous hidden state to carry versus new candidate information
  3. Icyo gate y'gusubiramo (reset gate) igenzura ni iki?
    • The final sequence length
    • Igipimo cyo kwiga cya optimizer
    • How much past information is used when forming a candidate state
    • Whether the update gate exists
  4. GRU isobanura amaboko (memory) uko bihura na LSTM?
    • It uses a separate cell state and three gates
    • It uses one hidden state rather than a separate cell state
    • It has no recurrent state
    • It stores the entire training sequence in the gates
  5. Ku gate y'ihindurwa (update gate) z ya GRU, agaciro kari hafi ya kimwe gakoresha iki?
    • Favor the new candidate state over the previous hidden state
    • Control how much past information is used in the reset-gated candidate
    • Decide when the sequence should stop processing
    • Carry most of the previous hidden state into the next state
  6. Kuki gating ishobora kufasha mu byerekezo birenze intera (long-range dependencies)?
    • It gives the model a learned route to preserve or update hidden information across steps
    • It eliminates all recurrent computation
    • It guarantees perfect memory at any length
    • It turns a sequence into an unordered set
  7. What distinguishes a GRU candidate state from the prior hidden state?
    • It is always the ground-truth next token
    • It is computed from the current input and reset-gated past information
    • It is copied unchanged from the input
    • It stores a second LSTM cell
  8. What should be concluded from fewer GRU gates than LSTM gates?
    • GRUs always outperform LSTMs
    • GRUs cannot model sequences
    • The architecture is simpler in this respect, but task performance still needs evaluation
    • Fewer gates guarantee better accuracy