Subspace Tracking from Missing and Outlier Corrupted Data

10/06/2018
by   Praneeth Narayanamurthy, et al.
0

We study the related problems of subspace tracking in the presence of missing data (ST-miss) as well as robust subspace tracking with missing data (RST-miss). Here "robust" refers to robustness to sparse outliers. In recent work, we have studied the RST problem without missing data. In this work, we show that simple modifications of our solution approach for RST also provably solve ST-miss and RST-miss under weaker and similar assumptions respectively. To our knowledge, our result is the first complete guarantee for both ST-miss and RST-miss. This means we are able to show that, under assumptions on only the algorithm inputs (input data and/or initialization), the output subspace estimates are close to the true data subspaces at all times. Our guarantees hold under mild and easily interpretable assumptions and handle time-varying subspaces (unlike all previous work). We also show that our algorithm and its extensions are fast and have competitive experimental performance when compared with existing methods.

READ FULL TEXT
POST COMMENT

Comments

There are no comments yet.

Authors

page 11

page 12

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...
06/12/2018

Streaming PCA and Subspace Tracking: The Missing Data Case

For many modern applications in science and engineering, data are collec...
05/24/2017

Provable Dynamic Robust PCA or Robust Subspace Tracking

Dynamic robust PCA refers to the dynamic (time-varying) extension of the...
07/08/2017

Subspace Clustering with Missing and Corrupted Data

Subspace clustering is the process of identifying a union of subspaces m...
12/17/2017

MEDRoP: Memory-Efficient Dynamic Robust PCA

Robust PCA (RPCA) is the problem of separating a given data matrix into ...
07/11/2016

On Deterministic Conditions for Subspace Clustering under Missing Data

In this paper we present deterministic conditions for success of sparse ...
10/29/2019

GLIMPS: A Greedy Mixed Integer Approach for Super Robust Matched Subspace Detection

Due to diverse nature of data acquisition and modern applications, many ...
This week in AI

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