The Minimum Number of Errors in the N-Parity and its Solution with an Incremental Neural Network

摘要

The N-dimensional parity problem is frequently a difficult classification task for Neural Networks. We found an expression for the minimum number of errors νf as function of N for this problem, performed by a perceptron. We verified this quantity experimentally for N=1,...,15 using an optimal train perceptron. With a constructive approach we solved the full N-dimensional parity problem using a minimal feedforward neural network with a single hidden layer of h=N units.