Toward efficient agnostic learning
- 1 January 1994
- journal article
- Published by Springer Nature in Machine Learning
- Vol. 17 (2-3) , 115-141
- https://doi.org/10.1007/bf00993468
Abstract
No abstract availableKeywords
This publication has 18 references indexed in Scilit:
- A Markovian extension of Valiant's learning modelPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Learning in the Presence of Malicious ErrorsSIAM Journal on Computing, 1993
- Decision theoretic generalizations of the PAC model for neural net and other learning applicationsInformation and Computation, 1992
- An improved boosting algorithm and its implications on learning complexityPublished by Association for Computing Machinery (ACM) ,1992
- Learning switching conceptsPublished by Association for Computing Machinery (ACM) ,1992
- Boosting a weak learning algorithm by majorityPublished by Elsevier ,1990
- Learnability and the Vapnik-Chervonenkis dimensionJournal of the ACM, 1989
- On the learnability of Boolean formulaePublished by Association for Computing Machinery (ACM) ,1987
- Central Limit Theorems for Empirical MeasuresThe Annals of Probability, 1978
- Probability Inequalities for Sums of Bounded Random VariablesJournal of the American Statistical Association, 1963