The redundancy of view-redundancy for co-training
Blum and Mitchell’s co-training is a (very deservedly) popular semi-supervised learning algorithm that relies on class-conditional feature independence, and view-redundancy (or view-agreement) for semi-supervised learning.
I will argue that the view-redundancy assumption is unnecessary, and along the way show how surrogate learning can be plugged into co-training (which is not all that surprising considering that both are multi-view semi-sup algorithms that rely on class-conditional view-independence).
I’ll first explain co-training with an example.
Co-training – The setup
Consider a classification problem on the feature space . I.e., a feature vector can be split into two as .
We make the rather restrictive assumption that and are class-conditionally independent for both classes. I.e., for .
(Note that unlike surrogate learning with mean-independence, both and are allowed to be multi-dimensional.)
Co-training makes an additional assumption that either view is sufficient for classification. This view-redundancy assumption basically states that the probability mass in the region of the feature space, where the Bayes optimal classifiers on the two views disagree with each other, is zero.
(The original co-training paper actually relaxes this assumption in the epilogue, but it is unnecessary to begin with, and the assumption has proliferated in later manifestations of co-training.)
We are given some labeled data (or a weak classifier on one of the views) and an large supply of unlabeled data. We are now ready to proceed with co-training to construct a Bayes optimal classifier.
Co-training – The algorithm
The algorithm is very simple. We use our weak classifier, say , (which we were given, or which we constructed using the measly labeled data) on the one view () to classify all the unlabeled data. We select the examples classified with high confidence, and use these as labeled examples (using the labels assigned by the weak classifier) to train a classifier on the other view ().
We now classify the unlabeled data with to similarly generate labeled data to retrain . This back-and-forth procedure is repeated until exhaustion.
Under the above assumptions (and with “sufficient” unlabeled data) and converge to the Bayes optimal classifiers on the respective feature views. Since either view is enough for classification, we just pick one of the classifiers and release it into the wild.
Co-training – Why does it work?
I’ll try to present an intuitive explanation of co-training using the example depicted in the following figure. Please focus on it intently.
The feature vector in the example is 2-dimensional and both views and are 1-dimensional. The class-conditional distributions are uncorrelated and jointly Gaussian (which means independent) and depicted by their equiprobability contours in the figure. The marginal class-conditional distributions are show along the two axes. Class is shown in red and class is shown in blue. The picture also shows some unlabeled examples.
Assume we have a weak classifier on the first view. If we extend the classification boundary for this classifier to the entire space , the boundary necessarily comprises of lines parallel to the axis. Let’s say there is only one such line and all the examples below that line are assigned class and all the examples above are assigned class .
We now ignore all the examples close to the classification boundary of (i.e., all the examples in the grey band) and project the rest of the points onto the axis.
How will these projected points be distributed along ?
Since the examples that were ignored (in the grey band) were selected based on their values, owing to class-conditional independence, the marginal distribution along for either class will be exactly the same as if none of the samples were ignored. This is the key reason for the conditional-independence assumption.
The procedure has two subtle, but largely innocuous, consequences.
First, since we don’t know how many class and class examples are in the grey band the relative ratio of the examples of the two classes in the not-ignored set may not the same as in the original full unlabeled sample set. If the class priors are known, this can easily be corrected for when we learn . If the class priors are unknown other assumptions on are necessary.
Second, when we project the unlabeled examples on to we assign them the labels given to them by which can be erroneous. In the figure above, there will be examples in the region indicated by A that are actually class but have been assigned class , and examples in region B that were from class but were called class .
Again because of the class-conditional independence assumption these erroneously labeled examples will be distributed according to the marginal class-conditional distributions. I.e., in the figure above we imagine, along the axis, a very low amplitude blue distribution with the same shape and location as the red distribution, and a very low amplitude red distribution with the same shape under the blue distribution. (Note . This is the noise in the original co-training paper.)
This amounts to having a labeled training set with label errors but with errors being generated independently of the location in the space. That is the number of errors in a region in the space is proportional to the number of examples in that region. These proportionally distributed errors are then washed out by the correctly labeled examples when we learn .
To recap, co-training works because of the following fact. Starting from a weak classifier on , we can generate very accurate and unbiased training data to train a classifier on .
No need for view-redundancy
Notice that, in the above example, we made no appeal to any kind of view-redundancy (other than whatever we may get gratis from the independence assumption).
The vigilant reader may however level the following two objections against the above argument-by-example.
1. We build and separately. So when the training is done, without view redundancy, we have not shown a way to pick from the two to apply to new test data.
2. At every iteration we need to select unlabeled samples that were classified with high-confidence by to feed to the trainer for . Without view-redundancy may be none of the samples will be classified with high confidence.
The first objection is easy to respond to. We pick neither nor for new test data. Instead we combine them to obtain a classifier . This is well justified because, under class-conditional independence, .
We react to the second objection by dropping the requirement of classifying with high-confidence altogether.
Dropping the high-confidence requirement by surrogate learning
Instead of training with examples that are classified with high confidence by , we train with all the examples (using the scores assigned to them by ).
At some iteration of co-training, define the random variable . Since and are class-conditionally independent, and are also class-conditionally independent. In particular is class-conditionally mean-independent of . Furthermore if is even a weakly useful classifier, barring pathologies, it will satisfy .
We can therefore apply surrogate learning under mean-independence to learn the classifier on . (This is essentially the same idea as Co-EM, which was introduced without much theoretical justification.)
Hopefully the above argument has convinced the reader that the class-conditional view independence assumption obviates the view-redundancy requirement.
A natural question to ask is whether the reverse is true. That is, if we are given view-redundancy, can we completely eliminate the requirement of class-conditional independence? We can immediately see that the answer is no.
For example, we can duplicate all the features for any classification problem so that view-redundancy holds trivially between the two replicates. Moreover, the second replicate will be statistically fully dependent on the first.
Now if we are given a weak classifier on the first view (or replicate) and try to use its predictions on an unlabeled data set to obtain training data for the second, it would be equivalent to feeding back the predictions of a classifier to retrain itself (because the two views are duplicates of one another).
This type of procedure (which is an idea decades old) has been called, among other things, self-learning, self-correction, self-training and decision-directed adaptation. The problem with these approaches is that the training set so generated is biased and other assumptions are necessary for the feedback procedure to improve over the original classifier.
Of course this does not mean that the complete statistical independence assumption cannot be relaxed. The above argument only shows that at least some amount of independence is necessary.