.png){kind=icon}
.png){kind=icon}
Return
A direct formulation for sparse PCA using semidefinite programming
.png){kind=icon}
OA
AI
DOI：10.1137/050645506.png)
.png){kind=icon}
.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Given a covariance matrix, we consider the problem of maximizing the variance explained by a particular linear combination of the input variables while constraining the number of nonzero coefficients in this combination. This problem arises in the decomposition of a covariance matrix into sparse factors or sparse principal component analysis (PCA), and has wide applications ranging from biology to finance. We use a modification of the classical variational representation of the largest eigenvalue of a symmetric matrix, where cardinality is constrained, and derive a semidefinite programming-based relaxation for our problem. We also discuss Nesterov's smooth minimization technique applied to the semidefinite program arising in the semidefinite relaxation of the sparse PCA problem. The method has complexity O(n(4) root log(n)/epsilon), where n is the size of the underlying covariance matrix and e is the desired absolute accuracy on the optimal value of the problem.
Keywords:
principal component analysis
Karhunen-Loeve transform
factor analysis
semidefinite relaxation
Moreau-Yosida regularization
semidefinite programming
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.