Boosting and hard-core set construction

Machine Learning

Volumn 51, Issue 3, 2003, Pages 217-238

  Klivans, Adam R ^a   Servedio, Rocco A ^b  

^a MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

^b HARVARD UNIVERSITY   (United States)

Author keywords

Boosting; Computational complexity; Hard core set construction

Indexed keywords

ALGORITHMS; ASYMPTOTIC STABILITY; BOOLEAN FUNCTIONS; COMPUTATIONAL COMPLEXITY; COMPUTER SCIENCE; PROBABILITY; RANDOM PROCESSES; THEOREM PROVING;

BOOSTING; HARD-CORE SET CONSTRUCTION; MEMBERSHIP QUERIES;

LEARNING SYSTEMS;

EID: 0038290332     PISSN: 08856125     EISSN: None     Source Type: Journal    
DOI: 10.1023/A:1022949332276     Document Type: Article

References (32)

1. Babai, L.; Fortnow, L.; Nisan, N., & Wigderson, A. (1993). BPP has subexponential time simulations unless exptime has publishable proofs. Computational Complexity, 3, 307-318.
2. Blum, A., Furst, M.; Jackson, J.; Kearns, M.; Mansour, Y., & Rudich, S. (1994). Weakly learning DNF and characterizing statistical query learning using Fourier analysis. In Proceedings of the Twenty-Sixth Annual Symposium on Theory of Computing (pp. 253-262). ACM.
3. Blumer, A., Ehrenfeucht, A., Haussler, D., & Warmuth, M. (1989). Learnability and the Vapnik-Chervonenkis dimension. Journal of the ACM, 36:4, 929-965.
4. Boneh, D., & Lipton, R. (1993). Amplification of weak learning over the uniform distribution. In Proceedings of the Sixth Annual Workshop on Computational Learning Theory (pp. 347-351). ACM.
5. Bshouty, N., Jackson, J., & Tamon, C. (1999). More efficient PAC learning of DNF with membership queries under the uniform distribution. In Proceedings of the Twelfth Annual Conference on Computational Learning Theory (pp. 286-295).
6. Drucker, H., & Cortes, C. (1996). Boosting decision trees. In Advances in Neural Information Processing Systems 8 (pp. 479-485).
7. Drucker, H., Cortes, C., Jacket, L. D., Lecun, Y., & Vapnik, V. (1994). Boosting and other ensemble methods. Neural Computation, 6:6, 1289-1301.
8. Drucker, J., Schapire, R., & Simard, P. (1993a). Boosting performance in neural networks. International Journal of Pattern Recognition and Machine Intelligence, 7:4, 705-719.
9. Drucker, H., Schapire, R., & Simard, P. (1993b). Improving performance in neural networks using a boosting algorithm. In Advances in Neural Information Processing Systems 5 (pp. 42-49).
10. Freund, Y,. (1990). Boosting a weak learning algorithm by majority. In Proceedings of the Third Annual Workshop on Computational Learning Theory (pp. 202-216).
11. Freund, Y. (1992). An improved boosting algorithm and its implications on learning complexity. In Proceedings of the Fifth Annual Workshop on Computational Learning Theory (pp. 391-398).
12. Freund, Y. (1995). Boosting a weak learning algorithm by majority. Information and Computation, 121:2, 256-285.
13. Freund, Y., & Schapire, R. (1997). A decision-theoretic generalization of on-line learning and an application to boosting. Journal of Computer and System Sciences, 55:1, 119-139.
14. Goldreich, O., Nisan, N., & Wigderson, A. (1995). On Yao's xor-lemma. Electronic Colloquium on Computational Complexity, TR95-050.
15. Impagliazzo, R. (1995). Hard-core distributions for somewhat hard problems. In Proceedings of the Thirty-Sixth Annual Symposium on Foundations of Computer Science (pp. 538-545). IEEE.
16. Impagliazzo, R., & Widgerson, A. (1997). P = BPP unless E has subexponential circuits: Derandomizing the xor lemma. In Proceedings of the Twenty-Ninth Annual Symposium on Theory of Computing (pp. 220-229).
17. Jackson, J. (1995). The Harmonic sieve: A novel application of Fourier analysis to machine learning theory and practice. Ph.D. Thesis, Carnegie Mellon University.
18. Jackson, J. (1997). An efficient membership-query algorithm for learning DNF with respect to the uniform distribution. Journal of Computer and System Sciences, 55, 414-440.
19. Jackson, J. (2002). Personal communication.
20. Jackson, J., & Craven, M. (1996). Learning sparse perceptrons. In Advances in Neural Information Processing Systems 8 (pp. 654-660).
21. Kearns, M., & Valiant, L. (1994). Cryptographic limitations on learning boolean formulae and finite automata. Journal of the ACM, 41:1, 67-95.
22. O(n1/3). In Proceedings of the Twenty-Sixth Annual Symposium on Theory of Computing (pp. 258-265).
23. Levin, L. (1986). Average case complete problems. SIAM Journal on Computing, 15:1, 285-286.
24. Muller, D., & Preparata, F. (1975). Bounds to complexities of networks for sorting and for switching. Journal of the ACM, 22:2, 195-201.
25. Nisan, N., & Wigderson, A. (1994). Hardness versus randomness. Journal of Computer and System Sciences, 49, 149-167.
26. Schapire, R. (1990). The strength of weak learnability. Machine Learning, 5:2, 197-227.
27. Schapire, R., & Singer, Y. (1998). Improved boosting algorithms using confidence-rated predictions. In Proceedings of the Eleventh Annual Conference on Computational Learning Theory (pp. 80-91).
28. Servedio, R. (2001). Smooth boosting and learning with malicious noise. In Proceedings of the Fourteenth Annual Conference on Computational Learning Theory (pp. 473-489).
29. Shaltiel, R. (2001). Towards proving strong direct product theorems. In Proceedings of the Sixteenth Conference on Computational Complexity (pp. 107-117).
30. Sudan, M., Trevisan, L., & Vadhan, S. (2001). Pseudorandom generators without the xor lemma. Journal of Computer and System Sciences, 62:2, 236-266.
31. Valiant, L. (1984). A theory of the learnable. Communications of the ACM, 27:11, 1134-1142.
32. Wigderson, A. (1999). Personal communication.