On boosting with polynomially bounded distributions

Journal of Machine Learning Research

Volumn 3, Issue 3, 2003, Pages 483-506

  Bshouty, Nader H ^a   Gavinsky, Dmitry ^a  

^a TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; ONLINE SYSTEMS; POLYNOMIALS; QUERY LANGUAGES;

BOOSTING TECHNIQUES;

LEARNING SYSTEMS;

EID: 0042967736     PISSN: 15324435     EISSN: None     Source Type: Journal    
DOI: 10.1162/153244303321897708     Document Type: Conference Paper

References (19)

1. N. Bshouty and V. Feldman. On Using Extended Statistical Queries to Avoid Membership Queries. Proceedings of the 14th Annual Conference on Computational Learning Theory, pp. 529-545, 2001.
2. N. Bshouty, J. Jackson and C. Tamon. More efficient PAC-learning of DNF with membership queries under the uniform distribution. Proceedings of the 12th Annual Conference on Computational Learning Theory, pp. 286-295, 1999.
3. S. Ben-David, P. M. Long and Y. Mansour. Agnostic Boosting. Proceedings of the 14th Annual Conference on Computational Learning Theory, pp. 507-516, 2001.
4. C. Domingo and O. Watanabe. MadaBoost: A modification of AdaBoost. Proceedings of the 13th Annual Conference on Computational Learning Theory, pp. 180-189, 2000.
5. Y. Freund. Boosting a weak learning algorithm by majority. Proceedings of the 3th Annual Conference on Computational Learning Theory, pp. 202-216, 1990.
6. Y. Freund. An improved boosting algorithm and its implications on learning complexity. Proceedings of the 5th Annual Conference on Computational Learning Theory, pp. 391-398, 1992.
7. Y. Freund. Boosting a weak learning algorithm by majority. Information and Computation 121(2), pp. 256-285, 1995.
8. Y. Freund. An adaptive version of the boost by majority algorithm. Proceedings of the 12th Annual Conference on Computational Learning Theory, pp. 102-113, 1999.
9. Y. Freund and R. E. Schapire. A decision-theoretic generalization of on-line learning and an application to boosting. Journal of Computer and System Sciences 55(1), pp. 119-139, 1997.
10. D. Gavinsky. Optimally-Smooth Adaptive Boosting and Application to Agnostic Learning. Proceedings of the 13th International Conference on Algorithmic Learning Theory, , 2002.
11. J. Jackson. An efficient membership-query algorithm for learning DNF with respect to the uniform distribution. Journal of Computer and System Sciences 55(3), pp. 414-440, 1997.
12. E. Kushilevitz and Y. Mansour. Learning Decision Trees using the Fourier Spectrum. SIAM Journal on Computing 22(6), pp. 1331-1348, 1993.
13. A. R. Klivans and R. A. Servedio. Boosting and Hard-Core Sets. Proceedings of the 40th Annual Symposium on Foundations of Computer Science, pp. 624-633, 1999.
14. M. Kearns and L. Valiant. Cryptographic limitations on learning boolean formulae and finite automata. Journal of the ACM 41(1), pp. 67-95, 1994.
15. L. Levin. Randomness and Non-determinism. Journal of Symbolic Logic 58(3), pp. 1102-1103, 1993.
16. Y. Mansour. Learning Boolean Functions via the Fourier Transform. Theoretical Advances in Neural Computing and Learning, Kluwe Academic Publishers, , 1994.
17. R. E. Schapire. The strength of weak learnability. Machine Learning 5(2), pp. 197-227, 1990.
18. R. Servedio. Smooth Boosting and Learning with Malicious Noise. Proceedings of the 14th Annual Conference on Computational Learning Theory, pp. 473-489, 2001.
19. L. Valiant. A theory of learnable. Communications of the ACM 27(11), pp. 1134-1142, 1984.