Boosting in the presence of noise

Journal of Computer and System Sciences

Volumn 71, Issue 3, 2005, Pages 266-290

  Kalai, Adam Tauman ^a   Servedio, Rocco A ^b  

^a TOYOTA TECHNOLOGICAL INSTITUTE AT CHICAGO   (United States)

^b Mailcode 0401 ^*  (United States)

Author keywords

Boosting; Branching programs; Computational learning theory; Noise tolerant learning; PAC learning

Indexed keywords

ACOUSTIC NOISE; COMPUTATION THEORY; RANDOM PROCESSES;

BOOSTING; BRANCHING PROGRAMS; COMPUTATIONAL LEARNING THEORY; NOISE-TOLERANT LEARNING; PAC LEARNING;

LEARNING ALGORITHMS;

EID: 24644494284     PISSN: 00220000     EISSN: 10902724     Source Type: Journal    
DOI: 10.1016/j.jcss.2004.10.015     Document Type: Conference Paper

References (17)

1. J. Aslam, and S. Decatur Specification and simulation of statistical query algorithms for efficiency and noise tolerance J. Comput. System Sci. 56 1998 191 208
2. A. Blum, A. Frieze, R. Kannan, and S. Vempala A polynomial-time algorithm for learning noisy linear threshold functions Algorithmica 22 1/2 1997 35 52
3. T.G. Dietterich An experimental comparison of three methods for constructing ensembles of decision trees bagging Machine Learning 40 2 2000 139 158
4. J. Friedman, T. Hastie, and R. Tibshirani Additive logistic regression a statistical view of boosting Ann. Statist. 28 2000 337 374
5. Y. Freund Boosting a weak learning alogrithm by majority Inform. Comput. 121 2 1995 256 285
6. Y. Freund, and R. Schapire A decision-theoretic generalization of on-line learning and an application to boosting J. Comput. System Sci. 55 1 1997 119 139
7. O. Goldreich, S. Goldwasser, and S. Micali How to construct random functions J. Assoc. Comput. Mach. 33 4 1986 792 807
8. J. Hastad, R. Impagliazzo, L. Levin, and M. Luby A pseudorandom generator from any one-way function SIAM J. Comput. 28 4 1999 1364 1396
9. A. Kalai Learning monotonic linear functions Proceedings of the 17th Annual Conference on Learning Theory 2004 487 501
10. M. Kearns Efficient noise-tolerant learning from statistical queries J. Assoc. Comput. Mach. 45 6 1998 983 1006
11. M. Kearns, and Y. Mansour On the boosting ability of top-down decision tree learning algorithms J. Comput. System Sci. 58 1 1999 109 128
12. M. Kearns, and R. Schapire Efficient distribution-free learning of probabilistic concepts Proceedings of the 31st Annual IEEE Symposium on Foundations of Computer Science 1990 382 391
13. M. Kearns, and L. Valiant Cryptographic limitations on learning boolean formulae and finite automata J. Assoc. Comput. Mach. 41 1 1994 67 95
14. M. Kearns, and U. Vazirani An Introduction to Computational Learning Theory 1994 MIT Press Cambridge, MA
15. Y. Mansour, and D. McAllester Boosting using branching programs J. Comput. System Sci. 64 1 2002 103 112
16. R. Schapire The strength of weak learnability Machine Learning 5 2 1990 197 227
17. R. Schapire Theoretical views of boosting Proceedings of the 10th International Conference on Algorithmic Learning Theory 1999 12 24