Provable Dynamic Robust PCA or Robust Subspace Tracking

05/24/2017
by   Praneeth Narayanamurthy, et al.
0

Dynamic robust PCA refers to the dynamic (time-varying) extension of the robust PCA (RPCA) problem. It assumes that the true (uncorrupted) data lies in a low-dimensional subspace that can change with time, albeit slowly. The goal is to track this changing subspace over time in the presence of sparse outliers. This work provides the first guarantee for dynamic RPCA that holds under weakened versions of standard RPCA assumptions and a few other simple assumptions. We analyze a novel algorithm based on the recently introduced Recursive Projected Compressive Sensing (ReProCS) framework. Our result is significant because (i) it removes the strong assumptions needed by the two previous complete guarantees for ReProCS-based algorithms; (ii) it shows that, it is possible to achieve significantly improved outlier tolerance by exploiting slow subspace change and a lower bound on most outlier magnitudes; and (iii) it proves that the proposed algorithm is online (after initialization), fast, and, has near-optimal storage complexity.

READ FULL TEXT
POST COMMENT

Comments

There are no comments yet.

Authors

page 8

page 32

page 34

page 35

12/17/2017

MEDRoP: Memory-Efficient Dynamic Robust PCA

Robust PCA (RPCA) is the problem of separating a given data matrix into ...
06/14/2020

Fast Robust Subspace Tracking via PCA in Sparse Data-Dependent Noise

This work studies the robust subspace tracking (ST) problem. Robust ST c...
04/13/2018

Fast, Parameter free Outlier Identification for Robust PCA

Robust PCA, the problem of PCA in the presence of outliers has been exte...
11/26/2017

Robust PCA and Robust Subspace Tracking

Principal Components Analysis (PCA) is one of the most widely used dimen...
10/06/2018

Subspace Tracking from Missing and Outlier Corrupted Data

We study the related problems of subspace tracking in the presence of mi...
09/19/2017

Finite Sample Guarantees for PCA in Non-Isotropic and Data-Dependent Noise

This work obtains novel finite sample guarantees for Principal Component...
03/11/2015

Online Matrix Completion and Online Robust PCA

This work studies two interrelated problems - online robust PCA (RPCA) a...
This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.