On Boosting with Polynomially Bounded Distributions
暂无分享,去创建一个
[1] Vitaly Feldman,et al. On using extended statistical queries to avoid membership queries , 2002 .
[2] Osamu Watanabe,et al. MadaBoost: A Modification of AdaBoost , 2000, COLT.
[3] Yoav Freund,et al. A decision-theoretic generalization of on-line learning and an application to boosting , 1995, EuroCOLT.
[4] Shai Ben-David,et al. Agnostic Boosting , 2001, COLT/EuroCOLT.
[5] Jeffrey C. Jackson,et al. An efficient membership-query algorithm for learning DNF with respect to the uniform distribution , 1994, Proceedings 35th Annual Symposium on Foundations of Computer Science.
[6] Nader H. Bshouty,et al. More efficient PAC-learning of DNF with membership queries under the uniform distribution , 2004, J. Comput. Syst. Sci..
[7] Leslie G. Valiant,et al. A theory of the learnable , 1984, CACM.
[8] Rocco A. Servedio,et al. Smooth boosting and learning with malicious noise , 2003 .
[9] Rocco A. Servedio,et al. Boosting and hard-core sets , 1999, 40th Annual Symposium on Foundations of Computer Science (Cat. No.99CB37039).
[10] Robert E. Schapire,et al. The strength of weak learnability , 1990, Mach. Learn..
[11] Yishay Mansour,et al. Learning Boolean Functions via the Fourier Transform , 1994 .
[12] Yoav Freund,et al. An Adaptive Version of the Boost by Majority Algorithm , 1999, COLT '99.
[13] Yoav Freund,et al. Boosting a weak learning algorithm by majority , 1995, COLT '90.
[14] Dmitry Gavinsky. Optimally-smooth adaptive boosting and application to agnostic learning , 2003 .
[15] Leslie G. Valiant,et al. Cryptographic Limitations on Learning Boolean Formulae and Finite Automata , 1993, Machine Learning: From Theory to Applications.
[16] Yoav Freund,et al. An improved boosting algorithm and its implications on learning complexity , 1992, COLT '92.
[17] Eyal Kushilevitz,et al. Learning decision trees using the Fourier spectrum , 1991, STOC '91.