Approximation and Learning of Convex Superpositions
- 31 August 1997
- journal article
- Published by Elsevier in Journal of Computer and System Sciences
- Vol. 55 (1) , 161-170
- https://doi.org/10.1006/jcss.1997.1506
Abstract
No abstract availableKeywords
This publication has 12 references indexed in Scilit:
- Scale-sensitive dimensions, uniform convergence, and learnabilityPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Efficient distribution-free learning of probabilistic conceptsJournal of Computer and System Sciences, 1994
- Fat-shattering and the learnability of real-valued functionsPublished by Association for Computing Machinery (ACM) ,1994
- Universal approximation bounds for superpositions of a sigmoidal functionIEEE Transactions on Information Theory, 1993
- Decision theoretic generalizations of the PAC model for neural net and other learning applicationsInformation and Computation, 1992
- Vapnik-Chervonenkis Classes of Definable SetsJournal of the London Mathematical Society, 1992
- Learnability and the Vapnik-Chervonenkis dimensionJournal of the ACM, 1989
- What Size Net Gives Valid Generalization?Neural Computation, 1989
- Universal Donsker Classes and Metric EntropyThe Annals of Probability, 1987
- Central Limit Theorems for Empirical MeasuresThe Annals of Probability, 1978