Smooth boosting and learning with malicious noise

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2111, Issue , 2001, Pages 473-489

  Servedio, Rocco A ^a  

^a HARVARD UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; COMPUTERS;

BOOSTING ALGORITHM; HIGH RATE; NOISE TOLERANCE; NOISE-TOLERANT; SAMPLE COMPLEXITY; WINNOW ALGORITHM;

LEARNING ALGORITHMS;

EID: 84943243676     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-44581-1_31     Document Type: Conference Paper

References (26)

1. J. Aslam and S. Decatur. Specification and simulation of statistical query algorithms for efficiency and noise tolerance, J. Comput. Syst. Sci. 56 (1998), 191-208.
2. P. Auer. Learning nested differences in the presence of malicious noise, Theoretical Computer Science 185(1) (1997), 159-175.
3. P. Auer and N. Cesa-Bianchi. On-line learning with malicious noise and the closure algorithm, Ann. Math. and Artif. Intel. 23 (1998), 83-99.
4. P. Bartlett, P. Long and R. Williamson. Fat-shattering and the learnability of real-valued functions, J. Comput. Syst. Sci., 52(3) (1996), 434-452.
5. P. Bartlett and J. Shawe-Taylor. Generalization performance of support vector machines and other pattern classifiers, in B. Scholkopf, C.J.C. Burges, and A.J. Smola, eds, Advances in Kernel Methods – Support Vector Learning, (1999), 43-54.
6. N. Cesa-Bianchi, E. Dichterman, P. Fischer, E. Shamir and H.U. Simon. Sampleefficient strategies for learning in the presence of noise, J. ACM 46(5) (1999), 684-719.
7. S. Decatur. Statistical queries and faulty PAC oracles, in “Proc. Sixth Work. on Comp. Learning Theory” (1993), 262-268.
8. T.G. Dietterich. An experimental comparison of three methods for constructing ensembles of decision trees: Bagging, boosting, and randomization. Machine Learning, 40(2) (2000), 139-158.
9. C. Domingo and O. Watanabe. MadaBoost: a modification of AdaBoost. in “Proc. 13th Conf. on Comp. Learning Theory” (2000), 180-189.
10. Y. Freund. An adaptive version of the boost by majority algorithm, in “Proc. Twelfth Conf. on Comp. Learning Theory” (1999), 102-113.
11. Y. Freund and R. Schapire. A decision-theoretic generalization of on-line learning and an application to boosting, J. Comput. Syst. Sci. 55(1) (1997), 119-139.
12. Y. Freund and R. Schapire. Large margin classification using the perceptron algorithm, in “Proc. 11th Conf. Comp. Learning Theory” (1998), 209-217.
13. C. Gentile and N. Littlestone. The robustness of the p-norm algorithms, in “Proc. 12th Ann. Conf. on Comp. Learning Theory” (1999), 1-11.
14. A. Grove, N. Littlestone and D. Schuurmans. General convergence results for linear discriminant updates, in “Proc. 10th Ann. Conf. on Comp. Learning Theory” (1997), 171-183.
15. R. Impagliazzo. Hard-core distributions for somewhat hard problems, in “Proc. 36th Symp. on Found. of Comp. Sci.” (1995), 538-545.
16. M. Kearns and M. Li. Learning in the presence of malicious errors, SIAM J. Comput. 22(4) (1993), 807-837.
17. M. Kearns, L. Valiant. Cryptographic limitations on learning boolean formulae and finite automata, J. ACM 41(1) (1994), 67-95. Also “Proc. 21st Symp. on Theor. of Comp.” (1989), 433-444.
18. A. Klivans and R. Servedio. Boosting and hard-core sets, in “Proc. 40th Ann. Symp. on Found. of Comp. Sci.” (1999), 624-633.
19. N. Littlestone. Redundant noisy attributes, attribute errors, and linear-threshold learning using winnow, in “Proc. Fourth Workshop on Computational Learning Theory,” (1991), 147-156.
20. Y. Mansour and M. Parnas. Learning conjunctions with noise under product distributions, Inf. Proc. Let. 68(4) (1998), 189-196.
21. R.E. Schapire. Theoretical views of boosting, in “Proc. 10th Int. Conf. on Algorithmic Learning Theory” (1999), 12-24.
22. R. Schapire, Y. Freund, P. Bartlett and W.S. Lee. Boosting the margin: a new explanation for the effectiveness of voting methods, Annals of Statistics 26(5) (1998), 1651-1686.
23. R. Servedio. PAC analogues of perceptron and winnow via boosting the margin, in “Proc. 13th Conf. on Comp. Learning Theory,” 2000.
24. J. Shawe-Taylor, P.L. Bartlett, R.C. Williamson and M. Anthony. Structural risk minimization over data-dependent hierarchies, IEEE Trans. Inf. Theory, 44(5) (1998), 1926-1940.
25. A. Taylor and W. Mann. Advanced Calculus, Wiley & Sons, 1972.
26. L.G. Valiant. Learning disjunctions of conjunctions, in “Proc. 9th Internat. Joint Conf. on Artif. Intel.” (1985), 560-566.