| Paper ID | SPTM-13.1 |
| Paper Title |
Fast and Provable Robust PCA via Normalized Coherence Pursuit |
| Authors |
Mostafa Rahmani, Amazon, United States; Ping Li, Baidu USA, United States |
| Session | SPTM-13: Models, Methods and Algorithms 1 |
| Location | Gather.Town |
| Session Time: | Thursday, 10 June, 13:00 - 13:45 |
| Presentation Time: | Thursday, 10 June, 13:00 - 13:45 |
| Presentation |
Poster
|
| Topic |
Signal Processing Theory and Methods: [SSP] Statistical Signal Processing |
| IEEE Xplore Open Preview |
Click here to view in IEEE Xplore |
| Virtual Presentation |
Click here to watch in the Virtual Conference |
| Abstract |
The idea of Innovation Search, initially proposed for data clustering, was recently used for outlier detection where the directions of innovation were utilized to measure the innovation of the data points. We study the Innovation Values computed by the Innovation Search algorithm under a quadratic cost function and it is proved that Innovation Values with the new cost function are equivalent to Leverage Scores. This interesting connection is utilized to establish several theoretical guarantees for a Leverage Score based robust PCA method and to design a new robust PCA method. Numerical and theoretical studies indicate that while the presented approach is fast and closed-form, it outperforms most existing algorithms. |
