GRU

Gated recurrent units are gated RNNs with fewer gates than LSTMs. They use update and reset gates to control hidden-state memory.

The update is:

The update gate controls how much new candidate state replaces old memory.

Key Ideas

  • GRUs are simpler than LSTMs because they merge cell and hidden state.
  • They are often faster and smaller than LSTMs while retaining useful gating.
  • They still process sequences recurrently, so long-range interaction is mediated through a hidden-state bottleneck.
  • They are useful as baselines for streaming or compact sequence models.

Gate Interpretation

GateRole
update gate interpolates old state and new candidate state
reset gate controls how much previous state contributes to candidate state
candidate proposed replacement memory

The final interpolation:

acts like a learned residual update over time.

GRU vs LSTM

AspectGRULSTM
memory statehidden state onlyhidden plus cell state
gatesupdate and resetinput, forget, output
parametersusually fewerusually more
baseline rolecompact recurrent baselinestronger gated recurrent baseline

The choice is rarely the main scientific claim; what matters is whether recurrent baselines are tuned fairly.

Evaluation Boundary

ClaimCheck
efficient sequence modelparameter count, latency, sequence length
long-range modelingtruncation and hidden-state bottleneck
streaming modelstate reset/carry policy
protein representationhomolog split and representation pooling

Practical Checks

  • Check whether the task needs bidirectional context.
  • Track how padding masks interact with hidden-state updates.
  • Verify whether the final representation is last state, pooled states, or token-level outputs.
  • Compare with state-space models when long sequences are central.
  • Are GRU and LSTM baselines matched in hidden size, parameters, and tuning budget?
  • Does padding update the hidden state accidentally?