Which side does z multiply?
numeric▲△△A GRU’s update gate sits at for ten steps while the candidate is zero. How much of the starting state survives under PyTorch’s convention, , and under Chung and colleagues’, ? How do you convert trained weights from one convention to the other?
Hint
With a zero candidate, each step multiplies the state by whichever factor sits next to .
Solution
Under PyTorch’s convention each step keeps : after ten steps of the starting state remains. Under the other, each step keeps : . The direct Jacobians are and respectively.
The two conventions describe the same functions. Since , negating the update gate’s input weights, recurrent weights and bias turns into . Loading weights without that step silently swaps keeping and overwriting.