ECCC
Electronic Colloquium on Computational Complexity
Login | Register | Classic Style



REPORTS > KEYWORD > LEARNING COMPLEXITY:
Reports tagged with learning complexity:
TR94-012 | 12th December 1994

Bounds for the Computational Power and Learning Complexity of Analog Neural Nets

It is shown that high order feedforward neural nets of constant depth with piecewise polynomial activation functions and arbitrary real weights can be simulated for boolean inputs and outputs by neural nets of a somewhat larger size and depth with heaviside gates and weights from {-1,0,1\}. This provides the first ... more >>>



ISSN 1433-8092 | Imprint