Construction of minimal n-2-n encoders for any n

  • Authors:

  • D. S. Phatak;H. Choi;I. Koren

  • Affiliations:

  • Department of Electrical and Computer Engineering, University of Massachusetts, Amherst, MA 01003 USA;Department of Electrical and Computer Engineering, University of Massachusetts, Amherst, MA 01003 USA;Department of Electrical and Computer Engineering, University of Massachusetts, Amherst, MA 01003 USA

  • Venue:
  • Neural Computation
  • Year:
  • 1993

Quantified Score

Hi-index 0.00

Visualization

Abstract

The encoding problem (Rumelhart and McClelland 1986) is an important canonical problem. It has been widely used as a benchmark. Here, we have analytically derived minimal-sized nets necessary and sufficient to solve encoding problems of arbitrary size. The proofs are constructive: we construct n-2-n encoders and show that two hidden units are also necessary for n 2. Moreover, the geometric approach employed is general and has much wider applications. For example, this method has also helped us derive lower bounds on the redundancy necessary for achieving complete fault tolerance (Phatak and Koren 1992a,b).