Complexity of learning in artificial neural networks
- 20 August 2001
- journal article
- research article
- Published by Elsevier in Theoretical Computer Science
- Vol. 265 (1-2) , 285-306
- https://doi.org/10.1016/s0304-3975(01)00167-0
Abstract
No abstract availableKeywords
This publication has 17 references indexed in Scilit:
- A physicist's approach to number partitioningTheoretical Computer Science, 2001
- Statistical mechanics methods and phase transitions in optimization problemsPublished by Elsevier ,2001
- Systems that can learn from examples: Replica calculation of uniform convergence bounds for perceptronsPhysical Review Letters, 1993
- Dynamics of learning for the binary perceptron problemZeitschrift für Physik B Condensed Matter, 1992
- Statistical mechanics of learning from examplesPhysical Review A, 1992
- The AdaTron: An Adaptive Perceptron AlgorithmEurophysics Letters, 1989
- Learning Networks of Neurons with Boolean LogicEurophysics Letters, 1987
- Comm. ACM: Leutt, K. N. and Kautz, W. H. ‘Cellular arrays for the solution of graph problems’. Vol 15 (September 1972) No 9, pp.789–801Computer-Aided Design, 1973
- PerceptronsThe American Journal of Psychology, 1971
- On the Distribution of the Number of Successes in Independent TrialsThe Annals of Mathematical Statistics, 1956