Research map / Learning theory and algorithms / Matrix and tensor methods
Exact Guarantees on the Absence of Spurious Local Minima for Non-negative Rank-1 Robust Principal Component Analysis
Salar Fattahi, Somayeh Sojoudi
Read the paperCheck your idea against 137,217 papers
AI-extracted. The measured effects below were read by AI from the paper's full text (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.
Measured effects reported in the paper
| What was changed | Where | Measured | Effect |
|---|---|---|---|
| require strictly positive true components instead of merely non-negative (ablation) | Sub-gradient method on symmetric rank-1 RPCA · 3x3 instance with u*=[1,1,0], one missing measurement | fraction of trials ending in spurious local solution: about 20% of the trials converge to spurious local solutions | Improved |
| use the non-smooth l1 loss instead of a smooth loss (ablation) | Sub-gradient method on positive rank-1 RPCA · Symmetric positive rank-1 RPCA, random instances | exact recovery rate | Improved |
Closest papers by meaning
- Informed Non-Convex Robust Principal Component Analysis With Features (AAAI 2018 · similarity 0.91)
- A Pseudo-Bayesian Algorithm for Robust PCA (NeurIPS 2016 · similarity 0.90)
- Projected Robust PCA with Application to Smooth Image Recovery (JMLR 2022 · similarity 0.90)
- RES-PCA: A Scalable Approach to Recovering Low-Rank Matrices (CVPR 2019 · similarity 0.90)
- Tensor Robust Principal Component Analysis: Exact Recovery of Corrupted Low-Rank Tensors via Convex Optimization (CVPR 2016 · similarity 0.90)
- Robust Principal Component Analysis with Side Information (ICML 2016 · similarity 0.90)
Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.
