﻿

AdaBoost, short for Adaptive Boosting, is a machine learning algorithm, formulated by Yoav Freund and Robert Schapire. It is a meta-algorithm, and can be used in conjunction with many other learning algorithms to improve their performance. AdaBoost is adaptive in the sense that subsequent classifiers built are tweaked in favor of those instances misclassified by previous classifiers. AdaBoost is sensitive to noisy data and outliers. Otherwise, it is less susceptible to the overfitting problem than most learning algorithms.

AdaBoost calls a weak classifier repeatedly in a series of rounds $t = 1,ldots,T$. For each call a distribution of weights $D_\left\{t\right\}$ is updated that indicates the importance of examples in the data set for the classification. On each round, the weights of each incorrectly classified example are increased (or alternatively, the weights of each correctly classified example are decreased), so that the new classifier focuses more on those examples.

The algorithm for the binary classification task

Given: $\left(x_\left\{1\right\},y_\left\{1\right\}\right),ldots,\left(x_\left\{m\right\},y_\left\{m\right\}\right)$ where $x_\left\{i\right\} in X,, y_\left\{i\right\} in Y = \left\{-1, +1\right\}$

Initialise $D_\left\{1\right\}\left(i\right) = frac\left\{1\right\}\left\{m\right\}, i=1,ldots,m.$

For $t = 1,ldots,T$:

* Find the classifier $h_\left\{t\right\} : X o \left\{-1,+1\right\}$ that minimizes the error with respect to the distribution $D_\left\{t\right\}$:
$h_\left\{t\right\} = arg min_\left\{h_\left\{j\right\} in mathcal\left\{H epsilon_\left\{j\right\}$, where $epsilon_\left\{j\right\} = sum_\left\{i=1\right\}^\left\{m\right\} D_\left\{t\right\}\left(i\right) \left[y_i e h_\left\{j\right\}\left(x_\left\{i\right\}\right)\right]$
* Prerequisite: $epsilon_\left\{t\right\} < 0.5$, otherwise stop.
* Choose $alpha_\left\{t\right\} in mathbf\left\{R\right\}$, typically $alpha_\left\{t\right\}=frac\left\{1\right\}\left\{2\right\} extrm\left\{ln\right\}frac\left\{1-epsilon_\left\{t\left\{epsilon_\left\{t$ where $epsilon_\left\{t\right\}$ is the weighted error rate of classifier $h_\left\{t\right\}$.
* Update:
$D_\left\{t+1\right\}\left(i\right) = frac\left\{ D_\left\{t\right\}\left(i\right) , e^\left\{- alpha_\left\{t\right\} y_\left\{i\right\} h_\left\{t\right\}\left(x_\left\{i\right\}\right)\right\} \right\}\left\{ Z_\left\{t\right\} \right\}$
where $Z_\left\{t\right\}$ is a normalization factor (chosen so that $D_\left\{t+1\right\}$ will be a probability distribution, i.e. sum one over all x).

Output the final classifier:

$H\left(x\right) = extrm\left\{sign\right\}left\left( sum_\left\{t=1\right\}^\left\{T\right\} alpha_\left\{t\right\}h_\left\{t\right\}\left(x\right) ight\right)$

The equation to update the distribution $D_\left\{t\right\}$ is constructed so that:

Thus, after selecting an optimal classifier $h_\left\{t\right\} ,$ for the distribution $D_\left\{t\right\} ,$, the examples $x_\left\{i\right\} ,$ that the classifier $h_\left\{t\right\} ,$ identified correctly are weighted less and those that it identified incorrectly are weighted more. Therefore, when the algorithm is testing the classifiers on the distribution $D_\left\{t+1\right\} ,$, it will select a classifier that better identifies those examples that the previous classifer missed.

tatistical Understanding of Boosting

Boosting can be seen as minimization of a convex loss function over a convex set of functions. [T. Zhang, "Convex Risk Minimization", Annals of Statistics, 2004.] Specifically, the loss being minimized is the exponential loss

:$sum_i e^\left\{-y_i f\left(x_i\right)\right\}$

and we are seeking a function

:$f = sum_t alpha_t h_t$

ee also

* Bootstrap aggregating
* LPBoost
* GentleBoost

References