arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2202.04061math.STstat.MLstat.TH
收藏

Entrywise Recovery Guarantees for Sparse PCA via Sparsistent Algorithms

Joshua Agterberg, Jeremias Sulam

英文摘要:

Sparse Principal Component Analysis (PCA) is a prevalent tool across a plethora of subfields of applied statistics. While several results have characterized the recovery error of the principal eigenvectors, these are typically in spectral or Frobenius norms. In this paper, we provide entrywise $\ell_{2,\infty}$ bounds for Sparse PCA under a general high-dimensional subgaussian design. In particular, our results hold for any algorithm that selects the correct support with high probability, those that are sparsistent. Our bound improves upon known results by providing a finer characterization of the estimation error, and our proof uses techniques recently developed for entrywise subspace perturbation theory.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑