Author:
DasGupta Bhaskar,Siegelmann Hava T.,Sontag Eduardo
Reference30 articles.
1. Barron, A.R., “Approximation and estimation bounds for artificial neural networks”, Proc. 4th Annual Workshop on Computational Learning Theory, Morgan Kaufmann, 1991, pp. 243–249.
2. Baum, E.B., and Haussler, D., “What size net gives valid generalization?,” Neural Computation, 1(1989): 151–160
3. Blum, A., and Rivest, R. L., “Training a 3-node neural network is NP-complete,” in Advances in Neural Information Processing Systems 2 (D.S. Touretzky, ed), Morgan Kaufmann, San Mateo, CA, 1990, pp. 9–18; also as “Training a 3-Node Neural Network is NP-Complete,” Neural Networks, 5(1992): 117-127.
4. Bruck, J., and Goodman, J.W., “On the power of neural networks for solving hard problems”, Journal of Complexity, 6(1990): 129–135.
5. Darken, C, Donahue, M., Gurvits, L., and Sontag, E., “Rate of approximation results motivated by robust neural network learning,” Proc. 6th ACM Workshop on Computational Learning Theory, Santa Cruz, July 1993, pp. 303–309.
Cited by
4 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Direct and Indirect Evolutionary Designs of Artificial Neural Networks;Intuitionistic and Type-2 Fuzzy Logic Enhancements in Neural and Optimization Algorithms: Theory and Applications;2020
2. Evolutionary Spiking Neural Networks for Solving Supervised Classification Problems;Computational Intelligence and Neuroscience;2019-03-28
3. Dynamical Systems and Interaction Networks;Models and Algorithms for Biomolecules and Molecular Networks;2016-01-15
4. On Approximate Learning by Multi-layered Feedforward Circuits;Lecture Notes in Computer Science;2000