Self Scaled Regularized Robust Regression

Yin Wang, Caglayan Dicle, Mario Sznaier, Octavia Camps; The IEEE Conference on Computer Vision and Pattern Recognition (CVPR), 2015, pp. 3261-3269

Abstract


Linear Robust Regression (LRR) seeks to find the parameters of a linear mapping from noisy data corrupted from outliers, such that the number of inliers (i.e. pairs of points where the fitting error of the model is less than a given bound) is maximized. While this problem is known to be NP hard, several tractable relaxations have been recently proposed along with theoretical conditions guaranteeing exact recovery of the parameters of the model. However, these relaxations may perform poorly in cases where the fitting error for the outliers is large. In addition, these approaches cannot exploit available a-priori information, such as co-occurrences. To circumvent these difficulties, in this paper we present an alternative approach to robust regression. Our main result shows that this approach is equivalent to a "self-scaled" l-1 regularized robust regression problem, where the cost function is automatically scaled, with scalings that depend on the a-priori information. Thus, the proposed approach achieves substantially better performance than traditional regularized approaches in cases where the outliers are far from the linear manifold spanned by the inliers, while at the same time exhibits the same theoretical recovery properties. These results are illustrated with several application examples using both synthetic and real data.

Related Material


[pdf]
[bibtex]
@InProceedings{Wang_2015_CVPR,
author = {Wang, Yin and Dicle, Caglayan and Sznaier, Mario and Camps, Octavia},
title = {Self Scaled Regularized Robust Regression},
booktitle = {The IEEE Conference on Computer Vision and Pattern Recognition (CVPR)},
month = {June},
year = {2015}
}