AI Paper Atlas

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

Sparse PCA via Covariance Thresholding

Yash Deshpande, Andrea Montanari

JMLR 2016 · Learning theory and algorithms › Matrix and tensor methods · approach: Sparse and robust PCA

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
use Covariance Thresholding instead of Diagonal Thresholdingsparse PCA support recovery · Synthetic sparse PCA, rank onefraction of support recovered: n >~ s0^2 log p -> n >~ s0^2Improved
increase dimension p with s0 proportional to sqrt(n), Covariance Thresholding (ablation)Covariance Thresholding · Synthetic sparse PCA, rank onefraction of support recovered: increases monotonically with p for s0 <= 1.1 sqrt(n)Improved
increase dimension p with s0 proportional to sqrt(n), Diagonal Thresholding (ablation)Diagonal Thresholding · Synthetic sparse PCA, rank onefraction of support recoveredHurt
use data-driven Covariance Thresholding instead of Diagonal Thresholding at small nwavelet-sparse signals (Three Peak, box), p=4096 · Three Peak and block-constant signals, beta=1.4signal reconstruction (visual)Improved

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