5 citations · 6 across the 2 of their papers we have counts for
5 papers
Online (and Offline) Robust PCA: Novel Algorithms and Performance Guarantees
Jinchun Zhan, Brian Lois, Namrata Vaswani
In this work, we study the online robust principal components' analysis (RPCA) problem. In recent work, RPCA has been defined as a problem of separating a low-rank matrix (true dat…
Online Matrix Completion and Online Robust PCA
Brian Lois, Namrata Vaswani
This work studies two interrelated problems - online robust PCA (RPCA) and online low-rank matrix completion (MC). In recent work by Candès et al., RPCA has been defined as a probl…
A Correctness Result for Online Robust PCA
Brian Lois, Namrata Vaswani
This work studies the problem of sequentially recovering a sparse vector and a vector from a low-dimensional subspace from knowledge of their sum . If…
Recursive Robust PCA or Recursive Sparse Recovery in Large but Structured Noise (parts 1 and 2 combined)
Chenlu Qiu, Namrata Vaswani, Brian Lois +1
This work studies the recursive robust principal components analysis (PCA) problem. If the outlier is the signal-of-interest, this problem can be interpreted as one of recursively…
Recursive Robust PCA or Recursive Sparse Recovery in Large but Structured Noise
Chenlu Qiu, Namrata Vaswani, Brian Lois +1
This work studies the recursive robust principal components' analysis(PCA) problem. Here, "robust" refers to robustness to both independent and correlated sparse outliers. If the o…