Robust PCA With Partial Subspace Knowledge

From MaRDI portal
Publication:4580647

DOI10.1109/TSP.2015.2421485zbMATH Open1394.94681arXiv1403.1591OpenAlexW2076422080MaRDI QIDQ4580647FDOQ4580647


Authors: Jinchun Zhan, Namrata Vaswani Edit this on Wikidata


Publication date: 22 August 2018

Published in: IEEE Transactions on Signal Processing (Search for Journal in Brave)

Abstract: In recent work, robust Principal Components Analysis (PCA) has been posed as a problem of recovering a low-rank matrix mathbfL and a sparse matrix mathbfS from their sum, mathbfM:=mathbfL+mathbfS and a provably exact convex optimization solution called PCP has been proposed. This work studies the following problem. Suppose that we have partial knowledge about the column space of the low rank matrix mathbfL. Can we use this information to improve the PCP solution, i.e. allow recovery under weaker assumptions? We propose here a simple but useful modification of the PCP idea, called modified-PCP, that allows us to use this knowledge. We derive its correctness result which shows that, when the available subspace knowledge is accurate, modified-PCP indeed requires significantly weaker incoherence assumptions than PCP. Extensive simulations are also used to illustrate this. Comparisons with PCP and other existing work are shown for a stylized real application as well. Finally, we explain how this problem naturally occurs in many applications involving time series data, i.e. in what is called the online or recursive robust PCA problem. A corollary for this case is also given.


Full work available at URL: https://arxiv.org/abs/1403.1591







Cited In (3)





This page was built for publication: Robust PCA With Partial Subspace Knowledge

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4580647)