Robust support vector machine training via convex outlier ablation

It is shown how outlier detection can be encoded in the large margin training principle of support vector machines by expressing a convex relaxation of the joint training problem as a semide finite program, and can yield superior results to the standard soft margin approach in the presence of outliers.

Abstract

One of the well known risks of large margin training methods, such as boosting and support vector machines (SVMs), is their sensitivity to outliers. These risks are normally mitigated by using a soft margin criterion, such as hinge loss, to reduce outlier sensitivity. In this paper, we present a more direct approach that explicitly incorporates outlier suppression in the training process. In particular, we show how outlier detection can be encoded in the large margin training principle of support vector machines. By expressing a convex relaxation of the joint training problem as a semidefinite program, one can use this approach to robustly train a support vector machine while suppressing outliers. We demonstrate that our approach can yield superior results to the standard soft margin approach in the presence of outliers.