Boosting in the presence of noise

Conference Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn , Issue , 2003, Pages 196-205

  Kalai, Adam ^a   Servedio, Rocco A ^b  

^a MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

^b Columbia University ^*  (United States)

Author keywords

Boosting; Machine Learning

Indexed keywords

COMPUTATIONAL COMPLEXITY; LEARNING ALGORITHMS; LEARNING SYSTEMS; SPURIOUS SIGNAL NOISE;

RANDOM CLASSIFICATION NOISE;

COMPUTATION THEORY;

EID: 0038784672     PISSN: 07349025     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (16)

1. J. Aslam and S. Decatur. Specification and simulation of statistical query algorithms for efficiency and noise tolerance. Journal of Computer and System Sciences, 56:191-208, 1998.
2. A. Blum, A. Frieze, R. Kannan, and S. Vempala. A polynomial time algorithm for learning noisy linear threshold functions. Algorithmica, 22(1/2):35-52, 1997.
3. T.G. Dietterich. An experimental comparison of three methods for constructing ensembles of decision trees: bagging, boosting, and randomization. Machine Learning, 40(2):139-158, 2000.
4. J. Friedman, T. Hastie, and R. Tibshirani. Additive logistic regression: A statistical view of boosting. The Annals of Statistics, 28:337-374, 2000.
5. Y. Freund. Boosting a weak learning alogrithm by majority. Information and Computation, 121(2),256-285, 1995.
6. Y. Freund and R. Schapire. A decision-theoretic generalization of on-line learning and an application to boosting. Journal of Computer and System Sciences, 55(1):119-139, 1997.
7. O. Goldreich, S. Goldwasser, and S. Micali. How to construct random functions. Journal of the Association for Computing Machinery, 33(4):792-807, 1986.
8. J. Hastad, R. Impagliazzo, L. Levin, and M. Luby. A pseudorandom generator from any one-way function. SIAM J. Comput., 28(4):1364-1396, 1999.
9. A. Kalai and R. Servedio. On the boosting ability of oblivious decision graphs. Unpublished manuscript, 2003.
10. M. Kearns. Efficient noise-tolerant learning from statistical queries. Journal of the ACM, 45(6):983-1006, 1998.
11. M. Kearns and Y. Mansour. On the boosting ability of top-down decision tree learning algorithms. Journal of Computer and System Sciences, 58(1):109-128, 1999.
12. M. Kearns and L. Valiant. Cryptographic limitations on learning boolean formulae and finite automata. Journal of the ACM, 41(1):67-95, 1994.
13. M. Kearns and U. Vazirani. An introduction to computational learning theory. MIT Press, Cambridge, MA, 1994.
14. Y. Mansour and D. McAllester. Boosting using branching programs. Journal of Computer and System Sciences, 64(1):103-112, 2002.
15. R. Schapire. The strength of weak learnability. Machine Learning, 5(2): 197-227, 1990.
16. R. Schapire. Theoretical views of boosting. In Proceedings of the Tenth International Conference on Algorithmic Learning Theory, pages 12-24, 1999.