Robust computation of linear models by convex relaxation

02/18/2012
by   Gilad Lerman, et al.
0

Consider a dataset 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 it 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 which 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.

READ FULL TEXT

page 17

page 18

page 19

page 20

page 22

research
05/28/2021

Privately Learning Subspaces

Private data analysis suffers a costly curse of dimensionality. However,...
research
03/05/2012

Sparse Subspace Clustering: Algorithm, Theory, and Applications

In many real-world problems, we are dealing with collections of high-dim...
research
06/24/2014

Fast, Robust and Non-convex Subspace Recovery

This work presents a fast and non-convex algorithm for robust subspace r...
research
06/18/2022

Pursuit of a Discriminative Representation for Multiple Subspaces via Sequential Games

We consider the problem of learning discriminative representations for d...
research
12/07/2013

Robust Subspace System Identification via Weighted Nuclear Norm Optimization

Subspace identification is a classical and very well studied problem in ...
research
11/06/2012

Tangent-based manifold approximation with locally linear models

In this paper, we consider the problem of manifold approximation with af...
research
05/22/2023

Representing Input Transformations by Low-Dimensional Parameter Subspaces

Deep models lack robustness to simple input transformations such as rota...

Please sign up or login with your details

Forgot password? Click here to reset