MEDRoP: Memory-Efficient Dynamic Robust PCA

by   Praneeth Narayanamurthy, et al.

Robust PCA (RPCA) is the problem of separating a given data matrix into the sum of a sparse matrix and a low-rank matrix. The column span of the low-rank matrix gives the PCA solution. Dynamic RPCA is the time-varying extension of RPCA. It assumes that the true data vectors lie 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. We propose an algorithm that we call Memory-Efficient Dynamic Robust PCA (MEDRoP). This relies on the recently studied recursive projected compressive sensing (ReProCS) framework for solving dynamic RPCA problems, however, the actual algorithm is significantly different from, and simpler than, previous ReProCS-based methods. The main contribution of this work is a theoretical guarantee that MEDRoP provably solves dynamic RPCA under weakened versions of standard RPCA assumptions, a mild assumption on slow subspace change, and two simple assumptions (a lower bound on most outlier magnitudes and mutual independence of the true data vectors). Our result is important because (i) it removes the strong assumptions needed by the three previous complete guarantees for ReProCS-based algorithms; (ii) it shows that, it is possible to achieve significantly improved outlier tolerance compared to static RPCA solutions by exploiting slow subspace change and a lower bound on most outlier magnitudes; (iii) it is able to track a changed subspace within a delay that is more than the subspace dimension by only logarithmic factors and thus is near-optimal; and (iv) it studies an algorithm that is online (after initialization), fast, and, memory-efficient (its memory complexity is within logarithmic factors of the optimal).



There are no comments yet.


page 28

page 30

page 31


Provable Dynamic Robust PCA or Robust Subspace Tracking

Dynamic robust PCA refers to the dynamic (time-varying) extension of the...

Online Matrix Completion and Online Robust PCA

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

Static and Dynamic Robust PCA via Low-Rank + Sparse Matrix Decomposition: A Review

Principal Components Analysis (PCA) is one of the most widely used dimen...

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

This work studies the robust subspace tracking (ST) problem. Robust ST c...

Low Rank Approximation in the Presence of Outliers

We consider the problem of principal component analysis (PCA) in the pre...

Subspace Tracking from Missing and Outlier Corrupted Data

We study the related problems of subspace tracking in the presence of mi...

Sparse Online Low-Rank Projection and Outlier Rejection (SOLO) for 3-D Rigid-Body Motion Registration

Motivated by an emerging theory of robust low-rank matrix representation...
This week in AI

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