Robust Computation of Linear Models by Convex Relaxation

Consider a data set of vector-valued observations that consists of noisy inliers, which are explained well by a low-dimensional subspace, along with some number of outliers. This work describes a convex optimization problem, called reaper, that can reliably fit a low-dimensional model to this type of data. This approach parameterizes linear subspaces using orthogonal projectors and uses a relaxation of the set of orthogonal projectors to reach the convex formulation. The paper provides an efficient algorithm for solving the reaper problem, and it documents numerical experiments that confirm that reaper can dependably find linear structure in synthetic and natural data. In addition, when the inliers lie near a low-dimensional subspace, there is a rigorous theory that describes when reaper can approximate this subspace.
Author(s): Gilad Lerman[sup.1] , Michael B. McCoy[sup.2] , Joel A. Tropp[sup.3] , Teng Zhang[sup.4] Author Affiliations: (1) Department of Mathematics, University of Minnesota, 127 Vincent Hall, 206 Church St SE, [...]