The N-bit even parity task

• There is a simple solution that requires N hidden units. – Each hidden unit computes whether more than M of the inputs are on. – This is a linearly separable problem. • There are many variants of this solution. – It can be learned. – It generalizes well if:

+1

output

-2      +2        -2      +2

>0       >1       >2      >3

1          0        1        0

input