Shared weights do not erase order
numeric▲△△For with and , compare the final states for inputs and . Derive when two inputs can be swapped without changing the final state.
Hint
Write the two final states in terms of , and before substituting.
Solution
The forward order gives . The reverse gives .
Generally the difference is
It is zero when or . With , this particular linear cell sums its inputs, so order is lost. For other , sharing the transition does not make the representation permutation-invariant. Even retains the final input and therefore distinguishes these two orders.
A nonlinear recurrent cell has a different equality condition; do not transfer the special sum-cell result to every RNN.