Abstract
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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Ben-David, S., Long, P.M., Mansour, Y.: Agnostic boosting. In: Proceedings of the 14th Annual Conference on Computational Learning Theory, pp. 507–516 (2001)
Bshouty, N., Gavinsky, D.: On boosting with optimal poly-bounded distributions. Journal of Machine Learning Research 3, 483–506 (2002)
Dasgupta, S., Long, P.: Boosting with diverse base classifiers. In: COLT (2003)
Dietterich, T.G.: An experimental comparison of three methods for constructing ensembles of decision trees: bagging, boosting, and randomization. Machine Learning 40(2), 139–158 (2000)
Freund, Y.: Boosting a weak learning algorithm by majority. Information and Computation 121(2), 256–285 (1995)
Freund, Y., Schapire, R.: Experiments with a new boosting algorithm. In: Proceedings of the Thirteenth International Conference on Machine Learning, pp. 148–156 (1996)
Freund, Y., Schapire, R.: A decision-theoretic generalization of on-line learning and an application to boosting. Journal of Computer and System Sciences 55(1), 119–139 (1997)
Gavinsky, D.: Optimally-smooth adaptive boosting and application to agnostic learning. Journal of Machine Learning Research 4, 101–117 (2003)
Kalai, A., Servedio, R.: Boosting in the presence of noise. In: Proceedings of the 35th Annual Symposium on Theory of Computing (STOC), pp. 196–205 (2003)
Maclin, R., Opitz, D.: An empirical evaluation of bagging and boosting. In: AAAI/IAAI, pp. 546–551 (1997)
Mansour, Y., McAllester, D.: Boosting using branching programs. Journal of Computer and System Sciences 64(1), 103–112 (2002)
Mason, L., Bartlett, P.L., Baxter, J.: Improved generalization through explicit optimization of margins. Machine Learning 38(3), 243–255 (2000)
Motwani, R., Raghavan, P.: Randomized Algorithms. Cambridge University Press, New York, NY (1995)
Rätsch, G., Onoda, T., Müller, K.-R.: Soft margins for AdaBoost. Machine Learning 42(3), 287–320 (2001)
Schapire, R.: The strength of weak learnability. Machine Learning 5(2), 197–227 (1990)
Schapire, R., Freund, Y., Bartlett, P., Lee, W.: Boosting the margin: a new explanation for the effectiveness of voting methods. Annals of Statistics 26(5), 1651–1686 (1998)
Servedio, R.: Smooth boosting and learning with malicious noise. Journal of Machine Learning Research 4, 633–648 (2003)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Long, P.M., Servedio, R.A. (2005). Martingale Boosting. In: Auer, P., Meir, R. (eds) Learning Theory. COLT 2005. Lecture Notes in Computer Science(), vol 3559. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11503415_6
Download citation
DOI: https://doi.org/10.1007/11503415_6
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-26556-6
Online ISBN: 978-3-540-31892-7
eBook Packages: Computer ScienceComputer Science (R0)