atlas

Research map / Learning theory and algorithms / Matrix and tensor methods

A Pseudo-Bayesian Algorithm for Robust PCA

NeurIPS 2016 · Learning theory and algorithms › Matrix and tensor methods · approach: Sparse and robust PCA · 8 citations (OpenAlex)

Read the paperCheck your idea against 108,967 papers

AI-extracted summary. Written by AI from the paper's title only (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
Replace PCP preprocessing with PB-RPCA before SSC (motion segmentation with outliers)SSC on Hopkins155 trajectories · Hopkins155, outlier ratio 0.1-0.4, with and without sub-samplingsegmentation error % (mean)Helped
Adopt symmetric PB-RPCA objective (Psi_c and Psi_r both learned) instead of asymmetric version (ablation)PB-RPCA phase transition recovery · Simulated 200x200 phase transitionrecovery success regionHelped
Use PB-RPCA's non-separable, concave log-det objective instead of PCP's convex penaltyRank-one cube-structured low-rank data with sparse outliers (hard case) · Synthetic hard case, increasing outlier ratiosuccess rateHelped
Use PB-RPCA instead of PCP for recovery on Gaussian iid low-rank phase transition dataRPCA phase transition · 200x200 simulated, Gaussian iid low-rank, outlier ratio vs rank ratiorecovery success regionHelped
Replace log-det terms with trace terms (reduces to convex PCP)PB-RPCA objective · Theoretical analysisobjective equivalenceNo clear effect

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