1 Introduction
A data set is imbalanced when its elements are not evenly divided between the classes. In practical applications it is not uncommon to see very high imbalance, where upwards of 90% of the available training data belong to only one class. Overlap is another common problem, which occurs when there are regions of the data space where the posterior class distributions are near equal, even when the priors are known with certainty. In these cases it is difficult to make a principled decision on how to divide the volume of these regions between the classes.
Although the overlap and imbalance problems have been studied previously, (see Weijters1997; Japkowicz2002; Akbani2004; Monard; Yaohua2007 for some representative works in this area), work on each problem has happened largely in isolation. Some authors (e.g. Auda1997; Visa; Prati2004; and Batista2005) have performed experiments in the presence of both factors; however, the nature of their interaction is still not well understood. Our finding that their effects are not independent is an important step towards a characterization of how these factors affect classifier performance.
We propose that the behaviour observed in the combined case can be explained by phenomenon we call “covert” overfitting. Covert overfitting is similar in principle to regular overfitting, but the ambiguities which lead to overfitting are present in the generative distributions of the classes, rather than just in the training set. This complication ensures that standard empirical regularization techniques, such as cross validation, or using a separate validation set for testing, are not able to detect this phenomenon. We explore this problem in detail, and offer several demonstrations of its occurrence, in the later sections of this paper.
In the first part of this paper we explore how the Support Vector Machine (SVM) classifier performs when faced with overlapping and imbalanced data sets. In contrast to previous work in this area, we directly address the question of how the relationship between these factors affects classifier performance. A key result of this work is that the effects from these factors are not independent. We show that, although neither factor acting alone has an unexpectedly strong effect, the presence of overlap and imbalance together causes performance degradation which is more severe than we are lead to expect by considering them independently. This is an extension of our previous work on the overlap and imbalance problems in
Denil2010b, but goes beyond it by offering an explanation and application of the combined effects. We also demonstrate how different signatures of these effects might be used as tools to measure overlap in real world data.2 Data and Experimental Setup
We build our analysis around a series of synthetic data sets in the from of two dimensional “backbone” models. To generate a data set we sample points form the region . The range along one dimension is divided into four regions with alternating class membership, (two regions for each class), while the two classes are indistinguishable in the other dimension (see Figure 1). These domains make a good candidate for study since they are relatively simple, both to visualize and to understand, yet the optimal decision boundary is sufficiently nonlinear to cause interesting effects to emerge. The main problems we discuss in this paper often do not appear in very simple domains; we have chosen our models to be sufficiently complex to demonstrate the issues at hand.
Throughout this paper it will be necessary for us to have a parameterization of the overlap and imbalance levels present in a particular data set. This will allow us to study classifier performance with respect to these parameters and to formulate a model of how they affect performance.
We parameterize the overlap level with such that when the two classes are completely separable and when both classes are distributed uniformly across the entire domain. Intermediate values of indicate overlap along the region boundaries.
The imbalance level, which we denote , is measured as the proportion of the data set belonging to the majority class.^{1}^{1}1We only consider in our experiments since, by this parameterization, corresponds to a data set with only one class present. When there is imbalance, we always take the second class as the majority class; however, since the class distributions are symmetric, in these models the distinction between “first” and “second” is somewhat arbitrary, hence our decision to consider only the degree of imbalance and ignore which particular class is present in the majority.
Using this scheme, we generate a series of data sets for each collection of experiments by varying one, or both, of the available parameters. Unless otherwise indicated, all our experiments are repeated using training sets of several different sizes varying (logarithmically) between 25 and 6400 examples (although in the interest of saving space we report only a subset of these results). Testing is done using newly generated data sets of the appropriate imbalance level, overlap level and size.
We assess classifier performance using the Fscore of the classifier trained on each data set, where the minority class is taken to be positive. The F
score is the harmonic mean of the precision and recall of a classifier and is a commonly used scalar measurement of performance. Our choice of positive class reflects the state of affairs present in many real world problems where it is difficult to obtain samples from the class of interest. The F
score is one of the family of Fscores and treats precision and recall as equally important.Our experiments here focus on the SVM classifier with an RBF kernel. In all cases parameter selection for the SVM was carried out using the simulated annealing procedure described in Boardman2006 to select optimal values for and .
3 Overlap and Imbalance in Isolation
In this section we look at how overlap and imbalance in isolation affect classifier performance. The purpose of this section is to provide some baseline results which will inform our analysis of the combined effects in Section 4.
3.1 Imbalance
This section shows a series of experiments using varying levels of imbalance. We confirm previous results from Japkowicz2002, which indicate that imbalance in isolation is not sufficient to degrade performance. This suggests that poor performance on imbalanced data sets is caused by other factors such as small disjuncts. (For a discussion of why the imbalance problem is best viewed as an instance of the small disjunct problem see Japkowicz2002, Japkowicz2003, and Jo2004).
is the number of training data used. Error bars show one standard deviation about the mean over 10 trials.
is the number data in the training and test sets.Performance results from our experiments are shown in Figure 2. When the training set size is large we observe that the imbalance level has very little effect on the classifier performance. Performance is only affected when either the imbalance level is very high (and then only slightly), or when there are very few training data. This is exactly what we expect from the existence of small disjuncts in these domains. The influence that the training set size has on performance can be seen explicitly in Figure 2.
In addition to the Fscores, we also recorded the number of support vectors from each run as a measure of the complexity of the trained models. Figure 2 shows the proportion of the training set retained as support vectors and that the imbalance level has no visible adverse effect on the complexity of the SVM solution. In fact, there is a slight drop in complexity when the imbalance level is very high; however, at high levels of imbalance there are very few training data available to support the minority side of the boundary. This interpretation is supported by the fact that as the training set size increases the overall proportion that is retained drops, and the complexity reduction at high imbalance levels becomes less apparent.
The major conclusion that we can draw here is that imbalance in isolation has no adverse affect on the SVM classifier, provided that the training set is sufficiently large. The reduced performance we see when the training set is small can be attributed to the fact that there are not sufficiently many minority examples to infer the class distribution. This is confirmed by the fact that with a large training set the performance is excellent, even on highly imbalanced domains.
3.2 Overlap
In contrast to the imbalance problem, the effects of overlap are not well characterized in the literature (although previous work on the problem can be found in Visa; Prati2004; and Yaohua2007). We use this section to demonstrate that overlapping classes cause the SVM to learn decision boundaries which lack parsimony.
Figure 3 shows performance results with respect to overlap level for a selection of training set sizes, with the explicit relationship between training set size and performance appearing in Figure 3. The experiments which produced these data follow the same procedure as those from Section 3.1, but here we vary the overlap level instead of the imbalance. As in the case of imbalance, we see that very small training sets tend to cause degraded performance; however, in this case the effect is much weaker and becomes less pronounced as the overlap level is increased (see Figure 3). This indicates that, unlike the case of imbalance, when the overlap level is high, it is unlikely that collecting more training data will produce a more accurate classifier.
In Figure 3
we see that performance of the SVM classifier in the presence of overlap shows a linear drop as the overlap level is increased, with the linearity becoming more pronounced with larger training sets. An important observation here is that this is precisely what we expect from an optimal classifier on these domains. When we introduce overlap into these (balanced) data sets we create ambiguous regions in the data space where the generative distributions for both classes are near equal. This means that even a classifier with perfect knowledge of the generative distributions will infer nearequal posterior probabilities in these regions, meaning that we cannot predict the class label better than chance.
It is more interesting here to examine the complexity of the SVM solutions, which we again measure using the proportion of the training set retained as support vectors (shown in Figure 3). The response here again appears linear, but in this case a linear response is somewhat alarming. The proportion of the training set retained as support vectors rises linearly as a function of the overlap level, and this effect is visible across a wide range of training set sizes. This indicates that increasing the size of the training set, which was a boon in the case of imbalance, actually causes the SVM solution to increase in complexity.
When overlap is present in isolation, the SVM classifier is able to achieve approximately optimal performance across a wide range of different training set sizes; however, despite the near optimal performance, as the overlap level is increased the complexity of the model rises sharply, both as a function of the overlap level and also as a function of the training set size. This is counterintuitive, as we generally expect that increasing the amount of training data should lead to “better” models. Due to how we introduce overlap into our distributions the complexity of the optimal solution is independent of the overlap level.
4 Combined Overlap and Imbalance
We now turn our attention to the behavior of the SVM in the presence of both overlap and imbalance simultaneously. We are interested in determining if it is possible to separate the contributions from each factor. If this is possible then we can assign blame for different portions of the performance degradation to each factor; however, if the effects of the two factors interact, this assignment of blame becomes much more complicated and less useful.
If the effects are independent (i.e. they do not interact) then the overlap and imbalance problems can reasonably be studied in isolation; however, if they are not independent it is important to understand the relationship between them, which can only come from studying them together. We will show that this is in fact the case, and our study of the combined effects gives rise to the discovery of a previously unreported phenomenon which we call covert overfitting.
4.1 Test for Independence
We first outline a method to test the hypothesis that overlap and imbalance have independent effects on classifier performance. Let us continue to use as a measure of overlap and as a measure of imbalance. The hypothesis can be expressed mathematically as the assumption that the performance surface with respect to and obeys the relation
where and are unknown functions. That is, we expect the total derivative of performance to be separable into the components contributed by each of and . This hypothesis of independence leads us to expect that we can consider the partial derivatives as functions of a single variable, i.e.
The functions and may not have simple or obvious functional forms, meaning that we cannot compute their values analytically; however, if and are known we can find a predicted value for , up to an additive constant, by evaluating
(1) 
Specific values for can be computed numerically by training a classifier on a data set with the appropriate level of overlap and imbalance. Since we expect the partial derivatives of to be independent, we can compute values for by evaluating for several values of while holding constant and taking a numerical derivative. Values for can be computed in a similar manner by holding constant and varying . These values can then be combined into predicted values for using (1). Comparing the predicted values for to the observed values will allow us to determine if our hypothesis of independence is sound.
The procedure for applying this model is illustrated in Figure 4, which shows a performance surface parameterized by the overlap and imbalance levels of the training set. First, we take measurements of this surface along the indicated axisaligned sections. This corresponds to measuring the effects of each factor in isolation, the results of which where shown in previous sections. These data, combined with the model of independence we have described here, allow us to make predictions for the combined case (the dashed line in Figure 4). Comparing these predicted values to the performance of actual classifiers trained on data sets with the corresponding levels of overlap and imbalance enables us to assess the correctness of the model. What we are looking for is a discrepancy between the model’s predictions and our observations (shown in the figure as the difference between the solid and dashed lines). If the predictions do not match well with our observations we can reject the model and conclude that there must be an interaction between the effects of overlap and imbalance on SVM performance.
4.2 Results
Comparisons between our model predictions and the observed performance on domains with combined overlap and imbalance are shown in Figure 5. These results clearly show that when the training set size is large, the performance predicted by assuming that overlap and imbalance are independent is very different than what is observed. On the other hand, when the training set is small the predictions are quite accurate, showing only a small (but still significant) deviation from the observed results.
In addition to showing performance which falls short of our model’s predictions, we see a sudden breaking point in performance beyond a certain level of combined overlap and imbalance. This effect is most pronounced when the training set is large, becoming less noticeable with fewer training data and disappearing entirely when the training set size is very small. This drop occurs consistently at approximately and with very little variation across different training set sizes. In Denil2010b we showed that the differences are statistically significant and that the drop is correlated with the peak complexity of these models.
Figure 6 shows the performance and complexity we observed in the combined case across several training set sizes. The data are presented here in the same format as Figures 2 and 3 for ease of comparison. These figures emphasize the breaking point in performance we see with combined overlap and imbalance. Crucially, we see that the performance beyond this breaking point is unchanged across the range of training set sizes we tested; however, more data can significantly improve the prebreakingpoint performance.
The model from Section 4.1 relies only on the independence of the imbalance and overlap problems in order to make predictions for performance in the combined case. Since we have shown that the model predictions are very poor, it is reasonable to conclude that the underlying assumption is incorrect; specifically, we claim that our results demonstrate that there is an interdependence between the effects of overlap and imbalance. The later sections of paper are devoted to characterizing this interdependence.
5 Covert Overfitting
In this section we propose an explanation for the performance and complexity behaviours we observe in the presence of overlap and imbalance. So far we have seen that:

Imbalance, in isolation, is not a significant problem for SVMs. When there are sufficiently many training data available the SVM forms simple models (as expected, given the simplicity of our domains) which show excellent performance, even when the degree of imbalance is very high.

Overlap, in isolation, causes SVMs to build very complex models which exhibit performance comparable to an optimal classifier. Although performance drops as the overlap level is increased, it is still optimal since the presence of overlap creates ambiguous regions where even an optimal classifier cannot predict the class label better than chance. However, the complexity of these models is extremely high, especially considering that the complexity required to achieve this performance is no different from the separable case.

When both factors are present in tandem not only does the SVM build overly complex models, as in the case of overlap inisolation, but the performance on these domains is also significantly reduced.
Since the underlying reasons for the behaviour in the case of imbalance in isolation is fairly well understood (see the beginning of Section 3.1 for references) we will focus on the remaining two cases here.
We hypothesize that the observed behaviour is a result of a phenomenon we call covert overfitting. Covert overfitting is similar to ordinary overfitting, in that it is a result of mistaking aberrations in the training data for characteristics of the generative class distributions. The key difference is that covert overfitting occurs in the ambiguous regions caused by overlap.
Since it is difficult to make a principled choice of where to place the boundary in an ambiguous region, the task of identifying covert overfitting is more difficult than its ordinary counterpart. Techniques like cross validation, which estimate the generalization performance by testing the classifier on data which was not used during training, are able to detect overfitting in
unambiguous regions since an overfit model will not generalize to good performance on the test data. Contrastingly, in ambiguous regions, many different boundaries will achieve comparable generalization performance, since the posterior class probabilities in these regions are nearly equal. This means that we cannot distinguish between parsimonious and overfit solutions in ambiguous regions based on generalization performance alone.We demonstrate that covert overfitting occurs using two different methods. Both of these methods rely on our ability to apply different degrees of smoothing to the boundary produced by a trained SVM. We present a regularization technique here adapted from Liang2010a (with previous work appearing in Downs2002 and Liang2008). The key insight allowing this method to function is a result of Liang’s work; however, we have enhanced the algorithm to allow SVM approximations using an arbitrary number of support vectors to be constructed in a single step. While the algorithm in Liang2010a removes one support vector per iteration, we are able to identify a subset of arbitrary size to remove while still maintaining the important properties of the algorithm.
5.1 Spectral Reduction
Given an SVM, we can express the hyperplane normal vector
, as a function of the support vectors [Scholkopf2002, chap. 7.3]. Let the support vectors be indexed by a set and suppose we can partition into two disjoint subsets, and , such that is a linearly independent set and the elements of are linearly dependent on the elements of . Also, define the function as the projection of into the span of . Following^{2}^{2}2A very similar derivation for the removal of a single support vector appears in Liang2010a. The derivation here has been rephrased in terms of the hyperplane normal vector, and slightly generalized to account for the removal of several support vectors at once. Liang, we can write:where the last equality defines . Here represents the th coordinate of with respect to . This derivation shows that any linearly dependent support vectors can be eliminated from the SVM by making an appropriate change to the Lagrange multipliers for the remaining independent support vectors. If we restrict in the above derivation to be less than the dimensionality of the span of the support vectors then the third equality becomes an approximation (since will no longer be linearly dependent on ) and we find, following Liang, that provided we select so as to minimize , the resulting SVM is the best approximation of the original, using support vectors.
It is important to note at this point that the in the above derivation must be expressed in the implicit space induced by the kernel. This complicates matters since this space may be very high, or even infinite, dimensional. Thus, we need a method which does not require us to compute explicit representations for the support vectors in the implicit space.
The solution to this problem is offered by the kernel matrix. The kernel matrix for an SVM with support vectors is an symmetric matrix , such that
where the are the support vectors and is the kernel function. The kernel matrix is the Gram matrix of the support vectors, after applying the implicit mapping implied by the kernel function, and encodes important information about the SVM. For instance, since the kernel matrix is a Gram matrix, is equal to the number of linearly independent support vectors. Furthermore, if we find a linearly independent spanning subset of the rows of , we can take the corresponding support vectors as a minimal set of support vectors required to reexpress as in the above derivation. In this way the original problem is reduced to finding a subset of the rows of which form a basis for its row space.
This basis can be found efficiently by computing the decomposition of . This gives a lower triangular matrix , an upper triangular matrix , and a permutation matrix , such that . The matrices and are not useful to us; however, the matrix has the useful property that its first rows are linearly independent. Since is a permutation matrix, we see immediately that we can use it to identify the rows of we require.
The preceding paragraph shows that we can use a linearly independent subset of the rows of to select a minimal set of support vectors which can be used to produce an exact reconstruction of the original SVM. We now address the problem of identifying which support vectors we can remove to produce an optimal rankreduced approximation of the original. The goal is to be able to select an arbitrary number of support vectors and to have a method which we can use to construct the best possible approximation to our original SVM using the specified number of support vectors, selected from among the support vectors of the original.
The key here is to notice that, since
is a symmetric matrix, we can take its eigenvalue decomposition
where
is an orthogonal matrix of eigenvectors and
is a diagonal matrix of eigenvalues. For convenience we can require the eigenvalues are ordered such that . If we let then we can rewrite this decomposition as(2) 
where the second equality holds since . We can use (2) to form approximations of by truncating the sum after some terms, giving
which is the best rank approximation of .
Since is an matrix with rank we can select linearly independent rows of which give a basis for its row space. Since is the best rank approximation of , it follows that the dimensions of ’s row space not represented in are the dimensions which provide the least contribution to . Since there is a 11 correspondence between the dimensionality of the kernel row space and the number of support vectors required to represent the SVM hyperplane, selecting linearly independent rows of corresponds to selecting support vectors whose presence has a large effect on the hyperplane.
We now have sufficient information to construct rankreduced approximations of a given SVM. Training an SVM in the usual way gives us a set of support vectors and their corresponding Lagrange multipliers. To construct an approximation of this SVM using support vectors we construct the kernel matrix, and its best rank approximation, . Identifying a subset of the rows of which form a basis for its row space tells us which of the support vectors to keep in the reduced model (there will be exactly of them). We then update the Lagrange multipliers using the rule,
(3) 
The new SVM, with support vectors selected using the decomposition of and Lagrange multipliers given by (3), is the best approximation of the original SVM using support vectors.
The procedure described in this section can be used to produce arbitrary rankreduced approximations of a trained SVM. This gives us access to an entire spectrum of increasingly more regularized versions of the SVM model. In the following sections we exploit this ability to gradually regularize our model in order to demonstrate the existence of covert overfitting.
5.2 Hyperplane Angles
The SVM is, at its core, a linear classifier. The ability to handle nonlinear problems comes from the kernel, which performs an implicit mapping into a high dimensional feature space. In this implicit space, the SVM decision boundary is represented as the zero levelset of a linear function. Since the function is linear, it can be described by its normal vector and so the similarity of two SVM models can be measured by the angle between the normal vectors of their corresponding hyperplanes.
We must avoid computing the normal vectors directly, since the dimensionality of the implicit space may be very high or even infinite. Nonetheless, it is still possible to compute the angle between two SVM hyperplanes in the implicit space without computing their representations explicitly.
In general, ignoring the constant term for simplicity, an SVM hyperplane is given by
where , is a matrix with the support vectors (represented in the implicit space) as its rows, and is the hyperplane normal vector. Crucially, the final equality shows that , which we do not want to compute directly (since is a matrix of vectors in the implicit space), but we can use to compute the inner product of hyperplane normals.
Suppose now that we have two SVMs, with hyperplane normals given by and the angle between them is
This expression is in terms of the inner products of the rows of and (i.e. inner products of support vectors in the implicit space) which can be computed efficiently using the kernel function. The term requires that both SVMs use the same kernel in order for this method to work. Since different kernels imply implicit mappings into different spaces, so the notion of an “angle” between the hyperplanes loses meaning when different kernels are used.
The method described here can be used to measure the angle between an SVM and a rankreduced approximation of the same model. We expect that higher rank approximations will produce hyperplanes which converge to the original (this follows directly from our regularization method); however, what we are interested in is the rate of convergence and more importantly, how the angle compares to performance. If covert overfitting is present we expect the performance of the rankreduced models to converge to the performance of the original much faster than the angle between their hyperplanes converges to 0.
5.3 Class Assignment Variation
If an SVM has placed its boundary in an ambiguous region, it should be possible to move the boundary within this region without affecting the performance of the classifier. This suggests a method for identifying covert overfitting by watching for a plateau in performance as the kernel rank is reduced. Since our smoothing method guarantees that we move the boundary as little as possible at each iteration, we expect that the first support vectors to be removed are those which encode information in the most complex regions of the boundary (which we expect to correspond to those regions where covert overfitting has occurred). If these details represent true features of the problem (i.e. the true class boundary is in fact complex in this region) then smoothing the SVM solution will cause a drop in performance; however, if details removed by the smoothing process are a result of covert overfitting then we expect the performance to remain approximately constant as they are removed.
If there are data points near the boundary, it is quite likely that small changes in the boundary position will cause their predicted label to change. This will happen regardless of whether or not the boundary correctly encodes the optimal separating line between the classes. Thus, we can look for the combined occurrence of two effects as an indication of covert overfitting:

The SVM rank must be substantially reduced before we see a significant drop in performance, and

There are many test data which have their predicted label change frequently as the rank drops.
Neither of these effects in isolation are sufficient to detect covert overfitting. If the classes are highly separated then it may be possible to reduce the rank substantially without affecting performance, as the boundary is free to move within the large margin; however, in this case we would not see variation in label assignment. Conversely, if we see varying label assignments but performance drops, then we are likely losing important information about the true class boundary, rather than details from covert overfitting. If the effects are present together then the constant performance indicates that the overall predictive power of the model is maintained, while at the same time the label assignment changes indicate that the boundary is moving in a region with a small margin.
5.4 Results
In order to demonstrate the existance of covert overfitting we built a synthetic data set with an overlap level of 0.4 and an imbalance level of 0.6, following the same procedure as for the previous experiments. We then trained an SVM classifier on this data set, using the simulated annealing procedure from Boardman2006, with cross validation to select parameter values. After an initial preprocessing step to remove redundant support vectors, we construct a series of rankreduced approximations using the method described in Section 5.1. We use each of these rankreduced SVMs to classify a test set drawn from the same generative distribution that was used for training. For each rankreduced SVM we measure the angle between its hyperplane and that of the original SVM, and record which elements of the test set have their class assignment change as each support vector is removed.
To decide when the original SVM is sufficiently well approximated by a rankreduced approximation, we compare the rankreduced performance to the original performance. We consider the rankreduced SVMs to be accurate reconstructions of the original if their test performance is greater than or equal to , where is the performance of the original classifier and is some small threshold. We call the lowestrank for which this occurs the sufficiency point and for our tests we chose . We are most interested in the behaviour of the reconstructions with rank greater than the sufficiency point, as these are the ones which we expect to show variation within the ambiguous region.
Figure 8 shows an overlaid plot of the performance of the rankreduced reconstructions and the angle between the original and approximated hyperplanes. The vertical line in the figures shows the sufficiency point. What should be immediately striking here is that not only can more than half the support vectors be removed without significantly altering the performance, but the angle between the original hyperplane and the rankreduced hyperplane at the sufficiency point is quite large.
As the kernel rank increases, the convergence (in angle) of the reconstructed hyperplanes towards the original is mostly smooth and monotonic, which is exactly what we expect from the reduction method. However, since the performance beyond the sufficiency point is fairly constant, and the angle between the reconstructed hyperplane and the original at the sufficiency point is large, it follows that there is a significant amount of information represented by the original SVM which is not necessary to achieve comparable performance.
This effect—the representation of additional information beyond what is required to achieve good performance—is an example of what we expect from ordinary overfitting. The difference here is that the test performance is not reduced by this behaviour, as the “extra” information in the training set which caused the overfitting is present in the test set as well. Because the training and test sets exhibit the same systematic problem, we cannot detect this phenomenon through validation of the performance alone.
Figure 8 shows the performance of the rankreduced SVM approximations overlaid on a visualization of the class assignment variation as the rank of the reconstruction is changed. To create this visualization, we divide the area of the figure into a grid of cells, where the rows correspond to elements of the test set and the columns correspond to the different kernel ranks. Each cell is shaded black if reducing the SVM rank by one causes the label assigned to the corresponding element of the training set to change. Note that this does not indicate if the label is correctly assigned, but instead tracks when removing a support vector causes the SVM to “change its mind” about which label should be assigned to each test instance. For ease of interpretation the data have been sorted along the vertical axis, ordered by the largest rank which causes their label to change. Again, we are interested in the behaviour of class assignments when the rank is greater than the sufficiency point.
In this case we can again see the effects of covert overfitting. In fact, we see that the majority of the variation in label assignment takes place after the sufficiency point, where performance is relatively constant. We repeated this experiment on a variety of different backbone models, with varying levels of overlap and imbalance, and we found that this behaviour is consistent. The number of test data whose label is changed before the sufficiency point is high when there is strong overlap, and the frequency of label assignment changes is typically densest in this region as well.
What remains unclear at this point is to what degree the variation is localized to the ambiguous regions. We have demonstrated that there is movement in the SVM hyperplane beyond the sufficiency point, and that this hyperplane movement causes significant changes in how the SVM assigns labels to test data, despite the performance remaining constant. However, it is possible that the label changes we are seeing are spread uniformly across the entire domain.
To show that the label changes are in fact localized in the ambiguous regions, we select the test data whose label is changed at least once after the sufficiency point has been reached and check if they are localized to the ambiguous region. Figure 9 shows the distribution of these data along the dimension in which they are distinguishable (recall from Section 2 that our 2D backbone models are indistinguishable in only one dimension). The distribution is clearly localized in the ambiguous regions with some additional variation near the boundaries (e.g. note the behaviour around the crisp boundary at 0.5).
Figure 9 demonstrates that the degree of localization of label variations to the ambiguous regions across several degrees of smoothing. The trend line in this figure shows, for each level of smoothing, the proportion of test data which have had their label assignment change at least once and lie in an ambiguous region. When the rank is extremely low the proportion is approximately 0.42, which is equal to the proportion of the entire test set which lies in an ambiguous region; however, we see that when we consider high rank approximations the label changes are highly localized to the ambiguous regions.
6 Conclusion
In this paper we first looked at how the overlap and imbalance problems in isolation affect performance of the SVM classifier. In the case of imbalance we saw that when there are sufficiently many training data, imbalance does not degrade the SVM performance. We also saw, in the case of overlap in isolation, that even when there are ambiguous regions in the data space, the SVM is still able to achieve approximately optimal performance. Naturally, in this case the overall performance is significantly lower than the imbalanced case, but this is a result of inherent ambiguity in the data themselves. Our experiments show that despite this ambiguity, the SVM is capable of learning models with performance comparable to an optimal classifier for these domains.
Although the performance on overlapping domains is quite good (compared to an optimal classifier), the complexity of the learned models is very high. Increasing either the size of the training set, or the degree of overlap, in these cases causes the SVM to learn more complex models. The increased complexity indicates a systematic weakness of the SVM classifier in the presence of overlapping data, since the optimal solution on our overlapped domains has the same complexity as the separable cases.
We used our performance measurements in the cases of imbalance and overlap in isolation to predict performance for the combined case, under the assumption that the factors act independently. We established, following our previous work in Denil2010b, that there is an interdependency between the effects from these two factors.
The later sections of this work offer a causal explanation for the behaviour in performance and complexity that we seen in the case of overlapped, as well as overlapped and imbalanced data. Our explanation postulates that the behaviour we see in these cases is caused by covert overfitting. In order to test this explanation we developed an SVM pruning method which allows us to build arbitrary rank approximations of a given SVM. We described two methods for exploiting this technique to identify the occurrence of covert overfitting; first by examining the hyperplane angle between an SVM and its low rank approximations and second by looking at the frequency and localization of label assignment changes with respect to the rank of the approximation. In both cases our findings are consistent with the occurrence of covert overfitting and provide evidence that it is a real problem for training high quality SVMs.
We established that when overlapping classes are present in the data a significant amount of the support vectors in a trained SVM model go towards encoding aspects of the boundary which do not increase the generalization performance. We also saw that the removal of these support vectors produces variation in class label assignment which is localized around the ambiguous regions of the data space. The degree of this localization is highest when the approximations are near to the original SVM.
One of the original goals of this work was to formulate a measure of overlap in real world data. To that end we have identified several characteristics, notably the relationship between overlap and imbalance, which such a measure must account for. We have also identified a specific behaviour, namely covert overfitting, which we have shown to be indicative of overlapping classes. We have demonstrated how this behaviour can be detected through two signature effects: redundancy in the support vectors of the trained model, and the variation of class assignments under regularization. Further work will investigate if these characteristics can be turned into an overlap measure which is applicable to real world data.