Learning from hints in neural networks
作者： Yaser S Abu-Mostafa
DOI: 10.1016/0885-064X(90)90006-Y
关键词:
摘要: … We shall report a positive result and a negative result in this paper. The positive result is a … also remains NP-complete if we are given the absolute values of the weights and need only to …
acm.org
elsevier.com
sci-hub.se 参考文章(9)
Jiawei Hong, On connectionist models Communications on Pure and Applied Mathematics. ,vol. 41, pp. 1039- 1050 ,(1988) , 10.1002/CPA.3160410804
Stephen Judd, On the complexity of loading shallow neural networks Journal of Complexity. ,vol. 4, pp. 177- 192 ,(1988) , 10.1016/0885-064X(88)90019-2
L. G. Valiant, A theory of the learnable symposium on the theory of computing. ,vol. 27, pp. 1134- 1142 ,(1984) , 10.1145/800057.808710
V. N. Vapnik, A. Ya. Chervonenkis, On the Uniform Convergence of Relative Frequencies of Events to Their Probabilities Measures of Complexity. ,vol. 16, pp. 11- 30 ,(2015) , 10.1007/978-3-319-21852-6_3
Yaser S. Abu-Mostafa, The Vapnik-Chervonenkis Dimension: Information versus Complexity in Learning Neural Computation. ,vol. 1, pp. 312- 317 ,(1989) , 10.1162/NECO.1989.1.3.312
D. E. Rumelhart, G. E. Hinton, R. J. Williams, Learning internal representations by error propagation Parallel distributed processing: explorations in the microstructure of cognition, vol. 1. ,vol. 1, pp. 318- 362 ,(1986)
Yaser S Abu-Mostafa, Random problems Journal of Complexity archive. ,vol. 4, pp. 277- ,(1988) , 10.1016/0885-064X(88)90011-8
L. G. Valiant, A theory of the learnable Communications of the ACM. ,vol. 27, pp. 1134- 1142 ,(1984) , 10.1145/1968.1972
V. N. Vapnik, A. Ya. Chervonenkis, On the Uniform Convergence of Relative Frequencies of Events to Their Probabilities Theory of Probability & Its Applications. ,vol. 16, pp. 264- 280 ,(1971) , 10.1137/1116025