On boosting with optimal poly-bounded distributions

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

Volumn 2111, Issue , 2001, Pages 490-506

  Bshouty, Nader H ^a   Gavinsky, Dmitry ^a  

^a TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

ADAPTIVE BOOSTING;

ADABOOST ALGORITHM; BOOSTING ALGORITHM; LEARNING PROBLEM; LEARNING PROCESS; LOWER BOUNDS; ON-LINE BOOSTING; PERFORMANCE LOSS; WEAK LEARNER;

COMPUTATION THEORY;

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

References (9)

1. [BJT99] N. Bshouty, J. Jackson, C. Tamon. More efficient PAC-learning of DNF with membership queries under the uniform distribution. Twelfth Annual Conference on Computational Learning Theory, 1999, pp. 286-295.
2. [F95] Y. Freund. Boosting a weak learning algorithm by majority. Information and Computation, 1995, 121(2), pp. 256-285.
3. [FS97] Y. Freund, R. E. Schapire. A decision-theoretic generalization of online learning and an application to boosting. Journal of Computer and System Sciences, 1997, 55(1), pp. 119-139.
4. [J97] J. Jackson. An efficient membership-query algorithm for learning DNF with respect to the uniform distribution. Journal of Computer and System Sciences, 1997, 55(3),pp. 414-440.
5. [KM93] E. Kushilevitz, Y. Mansour. Learning Decision Trees using the Fourier Spectrum. SIAM Journal on Computing, 1993, 22(6) pp. 1331-1348.
6. [KS99] A. R. Klivans, R. A. Servedio. Boosting and Hard-Core Sets. Proc. of 40th Foundations of Computer Science (FOCS), 1999, pp. 624-633.
7. [KV94] M. Kearns, L. Valiant. Cryptographic limitations on learning boolean formulae and finite automata. Journal of the ACM, 1994, 41(1) pp. 67-95.
8. [L93] L. Levin. Randomness and Non-determinism. Journal of Symbolic Logic, 1993, 58(3), pp. 1102-1103.
9. [V84] L. Valiant. A theory of learnable. Comm. ACM, 1984, 27, pp. 1134-1142.