AI Paper Atlas

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

JMLR 2020 · Learning theory and algorithms › Matrix and tensor methods · approach: Sparse and robust PCA · 18 citations (OpenAlex)

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 changedWhereMeasuredEffect
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 measurementfraction of trials ending in spurious local solution: about 20% of the trials converge to spurious local solutionsImproved
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 instancesexact recovery rateImproved

Closest papers by meaning

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.

Open scime draft

Get the next scime Dispatch and a monthly field update

Free. We send a confirmation link first; every email has a one-click unsubscribe. Privacy