CoBoosting explained

CoBoost is a semi-supervised training algorithm proposed by Collins and Singer in 1999.^[1] The original application for the algorithm was the task of named-entity recognition using very weak learners, but it can be used for performing semi-supervised learning in cases where data features may be redundant.

It may be seen as a combination of co-training and boosting. Each example is available in two views (subsections of the feature set), and boosting is applied iteratively in alternation with each view using predicted labels produced in the alternate view on the previous iteration. CoBoosting is not a valid boosting algorithm in the PAC learning sense.

Motivation

CoBoosting was an attempt by Collins and Singer to improve on previous attempts to leverage redundancy in features for training classifiers in a semi-supervised fashion. CoTraining, a seminal work by Blum and Mitchell, was shown to be a powerful framework for learning classifiers given a small number of seed examples by iteratively inducing rules in a decision list. The advantage of CoBoosting to CoTraining is that it generalizes the CoTraining pattern so that it could be used with any classifier. CoBoosting accomplishes this feat by borrowing concepts from AdaBoost.

In both CoTrain and CoBoost the training and testing example sets must follow two properties. The first is that the feature space of the examples can separated into two feature spaces (or views) such that each view is sufficiently expressive for classification. Formally, there exist two functions

f _{1(x} _{1)} and f _{2(x} _{2)} such that for all examples x = (x _{1,x} _{2)} , f _{1(x} _{1)=f} _{2(x} _{2)=f(x)} . While ideal, this constraint is in fact too strong due to noise and other factors, and both algorithms instead seek to maximize the agreement between the two functions. The second property is that the two views must not be highly correlated.

Algorithm

Input:

\{(x _{1,i} ,x _{2,i} )\} ^{n} _{i =1} , \{y _{i\}} ^{m} ^{i =1}

Initialize:

\forall i,j : g ^{0 (\boldsymbol{x} _{i}) =0} .

For

t =1 ,...,T and for j =1 , 2 :

Set pseudo-labels:

\hat{y _{i}} = \left\{ \begin{array}{ll} y _{i,} 1 \le i \le m \\ sign(g ^{t -1} _{3- j} (\boldsymbol{x _{3-j,i} })), m < i \le n \end \right.

Set virtual distribution:

D ^{j(i)} _{t} = (1)/(Z ^{j} _{t}) e ^{- \hat{y _{i}} g ^{t -1} _{j} (\boldsymbol{x _{j,i} })} where Z ^{j} _{t} = \sum ^{ne} _{i =1} ^{- \hat{y _{i}} g ^{t -1} _{j} (\boldsymbol{x _{j,i} })} Find the weak hypothesis h ^{j} _{t} that minimizes expanded training error. Choose value for \alpha _{t} that minimizes expanded training error.

Update the value for current strong non-thresholded classifier:

\forall i:g ^{t(\boldsymbol{x} _{j,i} }) = g_j^(\boldsymbol)+\alpha_th_t^j(\boldsymbol)

The final strong classifier output is

f(\boldsymbol{x}) = sign\left(\sum ^{T(\boldsymbol{x} _{j})\right)}

Setting up AdaBoost

CoBoosting builds on the AdaBoost algorithm, which gives CoBoosting its generalization ability since AdaBoost can be used in conjunction with many other learning algorithms. This build up assumes a two class classification task, although it can be adapted to multiple class classification. In the AdaBoost framework, weak classifiers are generated in series as well as a distribution over examples in the training set. Each weak classifier is given a weight and the final strong classifier is defined as the sign of the sum of the weak classifiers weighted by their assigned weight. (See AdaBoost Wikipedia page for notation). In the AdaBoost framework Schapire and Singer have shown that the training error is bounded by the following equation:

(1)/(m) \sum ^{m} _{i =1} e ^{\left( - y _{i\left(\sum} ^{T\alpha} ^{t} h _{t(\boldsymbol{x} _{i}} )\right)\right)} = \prod _{tZ} _{t}

Where

Z _{t} is the normalizing factor for the distribution D _{t+1} . Solving for Z _{t} in the equation for D _{t(i)} we get:Z _{t} = \sum _{i:x _{t\notin} x _{i}} D _{t(i)} + \sum _{i:x _{t\in} x _{i}} D ^{- y _{i\alpha} _{i} h _{t(\boldsymbol{x} _{i}} _{t(i)e} )}

Where

x _{t} is the feature selected in the current weak hypothesis. Three equations are defined describing the sum of the distributions for in which the current hypothesis has selected either correct or incorrect label. Note that it is possible for the classifier to abstain from selecting a label for an example, in which the label provided is 0. The two labels are selected to be either -1 or 1.W _{0} = \sum _{i:h _{t(x} _{i)=0}} D _{t(i)} W _{+} = \sum _{i:h _{t(x} _{i)=y} _{i}} D _{t(i)} W _{-} = \sum _{i:h _{t(x} _{i)=-y} _{i}} D _{t(i)}

Schapire and Singer have shown that the value

Z _{t} can be minimized (and thus the training error) by selecting \alpha _{t} to be as follows:\alpha _{t} = (1)/(ln \left( 2) (W _{+})/(W _{-}) \right)

Providing confidence values for the current hypothesized classifier based on the number of correctly classified vs. the number of incorrectly classified examples weighted by the distribution over examples. This equation can be smoothed to compensate for cases in which

W _{-} is too small. Deriving Z _{t} from this equation we get:Z _{t} = W _{0} + 2 \sqrt{W _{+W} _{-}}

The training error thus is minimized by selecting the weak hypothesis at every iteration that minimizes the previous equation.

AdaBoost with two views

CoBoosting extends this framework in the case where one has a labeled training set (examples from

1 ...m ) and an unlabeled training set (from m _{1...n} ), as well as satisfy the conditions of redundancy in features in the form of x _{i=(x} _{1,i} ,x _{2,i} ) . The algorithm trains two classifiers in the same fashion as AdaBoost that agree on the labeled training sets correct labels and maximizes the agreement between the two classifiers on the unlabeled training set. The final classifier is the sign of the sum of the two strong classifiers. The bounded training error on CoBoost is extended as follows, where Z _{CO} is the extension of Z _{t} :Z _{CO} = \sum ^{m} _{i =1} e ^{- y _{ig} _{1(\boldsymbol{x} _{1,i}} )} + \sum ^{m} _{i =1} e ^{- y _{ig} _{2(\boldsymbol{x} _{2,i}} )} + \sum ^{n} _{i = m +1} e ^{- f _{2(\boldsymbol{x} _{2,i}} )g _{1(\boldsymbol{x} _{1,i} })} + \sum_^n e^

Where

g _{j} is the summation of hypotheses weight by their confidence values for the j ^{th} view (j = 1 or 2). f _{j} is the sign of g _{j} . At each iteration of CoBoost both classifiers are updated iteratively. If g ^{t -1} _{j} is the strong classifier output for the j ^{th} view up to the t -1 iteration we can set the pseudo-labels for the jth update to be:\hat{y _{i}} = \left\{ \begin{array}{ll} y _{i} 1 \le i \le m \\ sign(g ^{t -1} _{3- j} (\boldsymbol{x _{3-j,i} })) m < i \le n \end \right.

In which

3- j selects the other view to the one currently being updated. Z _{CO} is split into two such that Z _{CO} = Z ^{2} _{CO} . WhereZ ^{j} _{CO} = \sum ^{n} _{i =1} e ^{- \hat{y _{i}} (g ^{t -1} _{j} (\boldsymbol{x _{i})+\alpha} ^{j(\boldsymbol{x} ^{j,i} }))}

The distribution over examples for each view

j at iteration t is defined as follows:D ^{j(i)} _{t} = (1)/(Z ^{j} _{t}) e ^{- \hat{y _{i}} g ^{t -1} _{j} (\boldsymbol{x _{j,i} })}

At which point

Z ^{j} _{CO} can be rewritten asZ ^{j} _{CO} = \sum ^{n} _{i =1} D ^{j} _{t} e ^{- \hat{y _{i}} \alpha ^{j(\boldsymbol{x} _{j,i} })}

Which is identical to the equation in AdaBoost. Thus the same process can be used to update the values of

\alpha ^{j} _{t} as in AdaBoost using \hat{y _{i}} and D ^{j} _{t} . By alternating this, the minimization of Z ^{1} _{CO} and Z ^{2} _{CO} in this fashion Z _{CO} is minimized in a greedy fashion.

References

Footnotes

Notes and References

1. Michael Collins and Yoram Singer, Unsupervised Models for Named Entity Classification. Proceedings of the 1999 Joint SIGDAT Conference on Empirical Methods in Natural Language Processing and Very Large Corpora, pp. 100-110, 1999.