The same ReLU network can send a different backward signal on a second row because the forward ReLU gate state changed. This lesson compares the existing backprop row with the second exact forward row, keeping the weights fixed and recomputing the row-level gradients.
highlighted = computed this step
Same weights, two rows
Use the same tiny network on row A, x=(1,2), and row B, x=(2,1). The weights and biases do not change; only the row changes, so the ReLU gate state can change.
z2(A)=−1,z2(B)=1
Row A closes the second gate
For row A, z2=-1, so ReLU'(z2)=0. Multiplying by that gate gives dL/dz2=0, so the second-branch entries dw21, dw22, and db2 are all 0.
dz2dL=−2⋅0=0
Row B opens the second gate
For row B, z2=1, so ReLU'(z2)=1. The second branch now carries dL/dz2=2, giving dw21=4, dw22=2, and db2=2.
dw21=2⋅2=4,dw22=2⋅1=2
Boundary
Backprop follows the actual forward gates for the row being differentiated. This is one exact row-level backward comparison only: not training, not convergence, not learning, and no generalization claim is made.
same weights; row-level gates choose the backward path