Agnostic boosting

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

Volumn 2111, Issue , 2001, Pages 507-516

  Ben David, Shai ^a   Long, Philip M ^b   Mansour, Yishay ^c  

^a TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

^b NATIONAL UNIVERSITY OF SINGAPORE   (Singapore)

^c TEL AVIV UNIVERSITY   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

ERRORS; PROBABILITY DISTRIBUTIONS;

AGNOSTIC BOOSTING; AGNOSTIC LEARNING; BOOSTING ALGORITHM; CLASS-F; MINIMAL ERRORS; TIME POLYNOMIALS; TRAINING SAMPLE;

COMPUTATION THEORY;

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

References (12)

1. P. L. Bartlett. The sample complexity of pattern classification with neural networks: the size of the weights is more important than the size of the network. IEEE Transactions on Information Theory, 44(2):525–536, 1998.
2. P. L. Bartlett and S. Ben-David. Hardness Results for Neural Network Approximation Problems. Proceedings of the 4th European Conference on Computational Learning Theory (EuroCOLT‘99), pp 50-62. Arevised version will appear in JCSS.
3. S. Ben-David, N. Eiron, and P. Long. On the difficulty of approximately maximizing agreement. Proceedings of the 13th Annual Conference on Computational Learning Theory, COLT00, pages 266–274, 2000.
4. S. Ben-David and H. U. Simon. Efficient learning of linear perceptrons. In NIPS, 2000.
5. Yoav Freund. Data Filtering and Distribution Modeling Algorithms for Machine Learning. PhD thesis, University of California at Santa Cruz, 1993. Retrievable from: ftp.cse.ucsc.edu/pub/tr/ucsc-crl-93-37.ps.Z.
6. Yoav Freund and Robert E. Schapire. Adecision-theoretic generalization of online learning and an application to boosting. In Computational Learning Theory: Second European Conference, EuroCOLT’95, pages 23–37. Springer-Verlag, 1995.
7. D. Haussler, M. Kearns, N. Littlestone, and M. K. Warmuth. Equivalence of models for polynomial learnability. Information and Computation, 95:129–161, 1991.
8. M. J. Kearns, R. E. Schapire, and L. M. Sellie. Toward efficient agnostic learning. Machine Learning, 17:115–141, 1994.
9. D. E. Knuth. The Art of Computer Programming, Volume II: Semi numerical Algorithms. Addison-Wesley, 1981.
10. Robert E. Schapire. The Design and Analysis of Efficient Learning Algorithms. PhD thesis, M. I. T., 1991.
11. Robert E. Schapire. Theoretical views of boosting and applications. In Tenth International Conference on Algorithmic Learning Theory, 1999.
12. L. G. Valiant. Atheory of the learnable. Communications of the ACM, 27(11):1134–1142, 1984.