论文信息 - How to solve the N-bit parity problem with two hidden units

How to solve the N-bit parity problem with two hidden units

We construct a three-layer feedforward network (one hidden layer) which can solve the N-bit parity problem employing just two hidden units. We discuss the implications of employing problem constraints into transfer functions for general pattern classification problems.

David G. Stork | James D. Allen

[1] David G. Stork,et al. How to solve the N-bit encoder problem with just one hidden unit , 1993, Neurocomputing.

[2] Yann LeCun,et al. Optimal Brain Damage , 1989, NIPS.

[3] James L. McClelland,et al. Parallel distributed processing: explorations in the microstructure of cognition, vol. 1: foundations , 1986 .

[4] Leonid Kruglyak,et al. How to Solve the N Bit Encoder Problem with Just Two Hidden Units , 1990, Neural Computation.

[5] Marvin Minsky,et al. Perceptrons: An Introduction to Computational Geometry , 1969 .

[6] Geoffrey E. Hinton,et al. Learning internal representations by error propagation , 1986 .