Pith. sign in

REVIEW 1 cited by

Sparse Principal Components Analysis

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 0901.4392 v1 pith:CN3JLV2A submitted 2009-01-28 math.ST stat.TH

classification math.STstat.TH
keywords factorprincipalanalysisbasissparsealgorithmcomponentsconsistent
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

Principal components analysis (PCA) is a classical method for the reduction of dimensionality of data in the form of n observations (or cases) of a vector with p variables. For a simple model of factor analysis type, it is proved that ordinary PCA can produce a consistent (for n large) estimate of the principal factor if and only if p(n) is asymptotically of smaller order than n. There may be a basis in which typical signals have sparse representations: most co-ordinates have small signal energies. If such a basis (e.g. wavelets) is used to represent the signals, then the variation in many coordinates is likely to be small. Consequently, we study a simple "sparse PCA" algorithm: select a subset of coordinates of largest variance, estimate eigenvectors from PCA on the selected subset, threshold and reexpress in the original basis. We illustrate the algorithm on some exercise ECG data, and prove that in a single factor model, under an appropriate sparsity assumption, it yields consistent estimates of the principal factor.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Estimating eigenvectors and eigenspaces of covariance matrices: Optimal Bounds and Conditions for Consistency

    math.ST 2026-07 conditional novelty 6.0 of 10

    Sample-covariance eigenvector and eigenspace errors are determined up to constant factors by the effective rank and the signal-to-gap ratio, giving near-optimal consistency thresholds.

Pith tools