atlas

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

Robust Principal Component Analysis with Side Information

ICML 2016 · Learning theory and algorithms › Matrix and tensor methods · approach: Sparse and robust PCA · 33 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
add row/column side features (PCPF) to robust PCArobust PCA on synthetic low-rank plus sparse matrices · synthetic, n=200, random sign modelrecoverable (rank, sparsity) region: substantial gray region recoverable only by PCPFHelped
add Eigendigit row features to robust PCA (PCPF vs PCP)MNIST denoising, linear SVM classification · MNIST, sparsity 0.05 to 0.3classification accuracy: e.g. 86.94 to 87.51 at rho=0.05Helped
add Eigendigit row features to robust PCA (PCPF vs PCP)MNIST denoising, kernel SVM classification · MNIST, sparsity 0.05 to 0.3classification accuracy: e.g. 95.17 to 95.74 at rho=0.05Helped
add Eigendigit row features to robust PCA (PCPF vs PCP)MNIST denoising, relative error to clean images · MNIST, sparsity 0.05 to 0.3relative error: e.g. 0.3643 to 0.3424 at rho=0.05Helped
increase feature dimension d relative to rank (lower d) (ablation)PCPF recoverability · synthetic, random sign model rho=0.2recoverable rankHelped

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