Optimally-smooth adaptive boosting and application to agnostic learning

Journal of Machine Learning Research

Volumn 4, Issue 1, 2004, Pages 101-117

  Gavinsky, Dmitry ^a  

^a UNIVERSITY OF CALGARY   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; ERROR ANALYSIS; POLYNOMIALS; PROBABILITY; STATISTICAL METHODS;

AGNOSTIC LEARNING; BOOSTING TECHNIQUE;

LEARNING SYSTEMS;

EID: 2342482532     PISSN: 15324435     EISSN: None     Source Type: Journal    
DOI: 10.1162/153244304322765667     Document Type: Article

References (20)

1. . A. Blumer, A. Ehrenfeucht, D. Haussler and M. K. Warmuth. Learnability and the Vapnik-Chervonenkis Dimension. Journal of the ACM 36(4), pp. 929-965, 1989.
2. 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.
3. A. Blum, M. Furst, J. Jackson, M. Kearns, Y. Mansour and S. Rudich. Weakly learning DNF and characterizing statistical query learning using Fourier analysis. Proceedings of the 26th Symposium on Theory of Computing, pp. 253-262, 1994.
4. N. Bshouty and D. Gavinsky. On Boosting with Optimal Poly-Bounded Distributions. Proceedings of the 14th Annual Conference on Computational Learning Theory, pp. 490-506, 2001.
5. 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.
6. 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.
7. C. Domingo and O. Watanabe. MadaBoost: A modification of AdaBoost. Proceedings of the 13th Annual Conference on Computational Learning Theory, pp. 180-189, 2000.
8. 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.
9. Y. Freund. Boosting a weak learning algorithm by majority. Information and Computation 121(2), pp. 256-285, 1995.
10. 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.
11. R. Impagliazzo. Hardcore Distributions for Somewhat Hard Problems. Proceedings of the 36th Annual Symposium on Foundations of Computer Science, pp. 538-545, 1995.
12. 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.
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. J. Kearns, R. E. Schapire and L. M. Sellie. Towards Efficient Agnostic Learning. Machine Learning 17, pp. 115-141, 1994.
15. M. Kearns and L. Valiant. Cryptographic limitations on learning boolean formulae and finite automata. Journal of the ACM 41(1), pp. 67-95, 1994.
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. V. N. Vapnik. Estimation of Dependences Based on Empirical Data. Springer, , 1982.
20. L. Valiant. A theory of learnable. Communications of the ACM 27(11), pp. 1134-1142, 1984.