Smooth boosting and learning with malicious noise

Journal of Machine Learning Research

Volumn 4, Issue 4, 2004, Pages 633-648

  Servedio, Rocco A ^a  

^a Columbia University ^*  (United States)

Author keywords

Boosting; Learning with Noise; Linear Threshold Functions

Indexed keywords

ALGORITHMS; BOOLEAN ALGEBRA; DATA HANDLING; FUNCTIONS; MATHEMATICAL MODELS; PROBABILITY; SPURIOUS SIGNAL NOISE;

BOOSTING; LEARNING WITH NOISE; LINEAR THRESHOLD FUNCTION; MALICIOUS NOISE;

LEARNING SYSTEMS;

EID: 2542488394     PISSN: 15324435     EISSN: None     Source Type: Journal    
DOI: 10.1162/153244304773936072     Document Type: Conference Paper

References (26)

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. P. Auer. Learning nested differences in the presence of malicious noise. Theoretical Computer Science, 185(1):159-175, 1997.
3. P. Auer and N. Cesa-Bianchi. On-line learning with malicious noise and the closure algorithm. Annals of Mathematics and Artificial Intelligence, 23:83-99, 1998.
4. P. Bartlett, P. Long, and R. Williamson, Fat-shattering and the learnability of real-valued functions. Journal of Computer and System Sciences, 52(3):434-452, 1996.
5. P. Bartlett and J. Shawe-Taylor. Generalization performance of support vector machines and other pattern classifiers, pages 43-54. MIT Press, 1999.
6. N. Cesa-Bianchi, E. Dichterman, P. Fischer, E. Shamir, and H.U. Simon. Sample-efficient strategies for learning in the presence of noise. Journal of the ACM, 46(5):684-719, 1999.
7. S. Decatur. Statistical queries and faulty PAC oracles. In Proceedings of the Sixth Workshop on Computational Learning Theory, pages 262-268, 1993.
8. 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.
9. C. Domingo and O. Watanabe. Madaboost: a modified version of adaboost. In Proceedings of the Thirteenth Annual Conference on Computational Learning Theory, pages 180-189, 2000.
10. Y. Freund. An adaptive version of the boost-by-majority algorithm. In Proceedings of the Twelfth Annual Conference on Computational Learning Theory, pages 102-113, 1999.
11. 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.
12. Y. Freund and R. Schapire. Large margin classification using the perceptron algorithm. In Proceedings of the Eleventh Annual Conference on Computational Learning Theory, pages 209-217., 1998.
13. C. Gentile and N. Littlestone. The robustness of the p-norm algorithms. In Proceedings of the 12th Annual Conference on Computational Learning Theory, pages 1-11, 1999.
14. A. Grove, N. Littlestone, and D. Schuurmans. General convergence results for linear discriminant updates. In Proceedings of the Tenth Annual Conference on Computational Learning Theory, pages 171-183, 1997.
15. R. Impagliazzo. Hard-core distributions for somewhat hard problems. In Proceedings of the ThirtySixth Annual Symposium on Foundations of Computer Science, pages 538-545, 1995.
16. M. Kearns and M. Li. Learning in the presence of malicious errors. SLAM Journal on Computing, 22(4): 807-837, 1993.
17. M. Kearns and L. Valiant. Cryptographic limitations on learning boolean formulae and finite automata. Journal of the ACM, 41(1):67-95, 1994.
18. A. Klivans and R. Servedio. Boosting and hard-core sets. In Proceedings of the Fortieth Annual Symposium on Foundations of Computer Science, pages 624-633, 1999.
19. N. Littlestone. Redundant noisy attributes, attribute errors, and linear-threshold learning using winnow. In Proceedings of the Fourth Annual Workshop on Computational Learning Theory, pages 147-156, 1991.
20. Y. Mansour and M. Parnas. Learning conjunctions with noise under product distributions. Information Processing Letters, 68(4):189-196, 1998.
21. R. Schapire. Theoretical views of boosting and applications. In Proceedings of the Tenth International Conference on Algorithmic Learning Theory, pages 12-24, 1999.
22. R. Schapire, Y. Freund, P. Bartlett, and W. Lee. Boosting the margin: a new explanation for the effectiveness of voting methods. Annals of Statistics, 26(5):1651-1686, 1998.
23. R. Servedio. PAC analogues of perceptron and winnow via boosting the margin. In Proceedings of the Thirteenth Annual Conference on Computational Learning Theory, pages 148-157, 2000.
24. J. Shawe-Taylor, P. Bartlett, R. Williamson, and M. Anthony. Structural risk minimization over data-dependent hierarchies. IEEE Transactions on Information Theory, 44(5): 1926-1940, 1998.
25. A. Taylor and W. Mann. Advanced Calculus. Wiley & Sons, 1972.
26. L. Valiant. Learning disjunctions of conjunctions. In Proceedings of the Ninth International Joint Conference on Artificial Intelligence, pages 560-566, 1985.