Approximation by neural networks and learning theory
Author:
- V. MaiorovVMV. Maiorov
- 1 February 2006
- journal article
- conference paper
- Published by Elsevier in Journal of Complexity
- Vol. 22 (1) , 102-117
Abstract
No abstract availableKeywords
This publication has 16 references indexed in Scilit:
- Local Rademacher complexitiesThe Annals of Statistics, 2005
- On the mathematical foundations of learningBulletin of the American Mathematical Society, 2001
- Lower bounds for multivariate approximation by affine-invariant dictionariesIEEE Transactions on Information Theory, 2001
- On the optimality of neural-network approximation using incremental algorithmsIEEE Transactions on Neural Networks, 2000
- Lower bounds for approximation by MLP neural networksNeurocomputing, 1999
- Approximation theory of the MLP model in neural networksActa Numerica, 1999
- On the Value of Partial Information for Learning from ExamplesJournal of Complexity, 1997
- Sphere packing numbers for subsets of the Boolean n-cube with bounded Vapnik-Chervonenkis dimensionJournal of Combinatorial Theory, Series A, 1995
- Sharper Bounds for Gaussian and Empirical ProcessesThe Annals of Probability, 1994
- The sizes of compact subsets of Hilbert space and continuity of Gaussian processesJournal of Functional Analysis, 1967