Robust PCA via Non-convex Methods: Provable Bounds
summary
Claims a provable non‑convex algorithm that exactly recovers a low‑rank plus sparse decomposition under the same deterministic incoherence and sparsity regimes as convex methods, using an initial thresholding of large entries followed by alternating rank projections with stage‑wise rank growth and rank‑r SVD per iteration. Tolerates up to Θ(n/r) corruptions per row/column under incoherence, runs in roughly O(r^2 n^2) versus O(n^3) for full SVD convex solvers, converges in O(log(1/ε)) steps, and shows faster, cleaner foreground/background recovery in experiments.
AI-written summary · about
chapters (19)
- 0:00Intro
- 1:38Learning with Big Data
- 2:28PCA: Classical Method
- 3:20Robust PCA Problem
- 6:02History
- 8:16Why is Robust PCA difficult?
- 9:28Convex Relaxation Techniques
- 10:29Other Alternatives for Robust PCA?
- 13:59Proposal for Non-convex Robust PCA
- 16:50Observations regarding non-convex analysis
- 18:17Non-convex success stories
- 22:40Outline
- 24:14Toy example: Rank-1 case
- 28:55Rank-1 Analysis Contd.
- 38:17Extension to general rank: challenges
- 40:56Improved Algorithm for General Rank Setting
- 45:16Synthetic Results
- 46:17Real data: Foreground/background Separation
- 48:21Conclusion
related talks
28mRandomized Constrained Matrix Decompositions
45mHigh Dimensional Robust Sparse Regression
17mTowards Practical Algorithms for Outlier-Robust Estimation
44mSome Problems of Robust High-dimensional Statistics
51mTwo Concise Representations for High-Dimensional Visual Data
40mOptimally Weighted PCA for High-Dimensional Heteroscedastic Data
45mNoisy Estimation of Simultaneously Structured Models
39mMemory Limited, Streaming PCA
