Martingale Boosting

Martingale boosting is a simple and easily understood technique with a simple and easily understood analysis. A slight variant of the approach provably achieves optimal accuracy in the presence of random misclassification noise.

[1]  Noga Alon,et al.  The Probabilistic Method , 2015, Fundamentals of Ramsey Theory.

[2]  Thomas G. Dietterich.  An Experimental Comparison of Three Methods for Constructing Ensembles of Decision Trees: Bagging, Boosting, and Randomization , 2000, Machine Learning.

[3]  Dmitry Gavinsky.  Optimally-smooth adaptive boosting and application to agnostic learning , 2003 .

[4]  Dmitry Gavinsky,et al.  On Boosting with Polynomially Bounded Distributions , 2002, J. Mach. Learn. Res..

[5]  Yoav Freund,et al.  A decision-theoretic generalization of on-line learning and an application to boosting , 1995, EuroCOLT.

[6]  Yishay Mansour,et al.  Boosting Using Branching Programs , 2000, J. Comput. Syst. Sci..

[7]  Philip M. Long,et al.  Boosting with Diverse Base Classifiers , 2003, COLT.

[8]  R. Schapire.  The Strength of Weak Learnability , 1990, Machine Learning.

[9]  G DietterichThomas.  An Experimental Comparison of Three Methods for Constructing Ensembles of Decision Trees , 2000 .

[10]  Shai Ben-David,et al.  Agnostic Boosting , 2001, COLT/EuroCOLT.

[11]  Rocco A. Servedio,et al.  Boosting in the presence of noise , 2003, STOC '03.

[12]  David W. Opitz,et al.  An Empirical Evaluation of Bagging and Boosting , 1997, AAAI/IAAI.

[13]  Rocco A. Servedio,et al.  Smooth Boosting and Learning with Malicious Noise , 2001, J. Mach. Learn. Res..

[14]  Yoav Freund,et al.  Boosting the margin: A new explanation for the effectiveness of voting methods , 1997, ICML.

[15]  Yoav Freund,et al.  Boosting a weak learning algorithm by majority , 1990, COLT '90.

[16]  Yoav Freund,et al.  Experiments with a New Boosting Algorithm , 1996, ICML.

[17]  Dmitry Gavinsky,et al.  On Boosting with Optimal Poly-Bounded Distributions , 2001, COLT/EuroCOLT.

[18]  Peter L. Bartlett,et al.  Improved Generalization Through Explicit Optimization of Margins , 2000, Machine Learning.

[19]  Gunnar Rätsch,et al.  Soft Margins for AdaBoost , 2001, Machine Learning.

[20]  Rajeev Motwani,et al.  Randomized algorithms , 1996, CSUR.