pith. sign in

arxiv: 1309.6818 · v1 · pith:LHLTBHFOnew · submitted 2013-09-26 · 💻 cs.LG · stat.ML

Boosting in the presence of label noise

classification 💻 cs.LG stat.ML
keywords robustadaboostalgorithmboostinglabelnoiselabel-noisealthough
0
0 comments X
read the original abstract

Boosting is known to be sensitive to label noise. We studied two approaches to improve AdaBoost's robustness against labelling errors. One is to employ a label-noise robust classifier as a base learner, while the other is to modify the AdaBoost algorithm to be more robust. Empirical evaluation shows that a committee of robust classifiers, although converges faster than non label-noise aware AdaBoost, is still susceptible to label noise. However, pairing it with the new robust Boosting algorithm we propose here results in a more resilient algorithm under mislabelling.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.