Back-propagation is not Efficient
- 31 August 1996
- journal article
- Published by Elsevier in Neural Networks
- Vol. 9 (6), 1017-1023
- https://doi.org/10.1016/0893-6080(95)00135-2
Abstract
No abstract availableKeywords
This publication has 11 references indexed in Scilit:
- Functionally Equivalent Feedforward Neural NetworksNeural Computation, 1994
- Perspectives of Current Research about the Complexity of Learning on Neural NetsPublished by Springer Nature ,1994
- Constructive higher-order network that is polynomial timeNeural Networks, 1993
- Computational limitations on training sigmoid neural networksInformation Processing Letters, 1993
- Finiteness results for sigmoidal “neural” networksPublished by Association for Computing Machinery (ACM) ,1993
- Training a 3-node neural network is NP-completeNeural Networks, 1992
- Complexity results on learning by neural netsMachine Learning, 1991
- A Polynomial Time Algorithm That Learns Two Hidden Unit NetsNeural Computation, 1990
- Neural Network Design and the Complexity of LearningPublished by MIT Press ,1990
- Learning representations by back-propagating errorsNature, 1986