Truncated Power Method for Sparse Eigenvalue Problems

Details Truncated Power Method for Sparse Eigenvalue Problems Truncated Power Method for Sparse Eigenvalue Problems

2011-12-12

arxiv.org/abs/1112.2679v1

Statistics

Machine Learning

Scientific paper

This paper considers the sparse eigenvalue problem, which is to extract dominant (largest) sparse eigenvectors with at most $k$ non-zero components. We propose a simple yet effective solution called truncated power method that can approximately solve the underlying nonconvex optimization problem. A strong sparse recovery result is proved for the truncated power method, and this theory is our key motivation for developing the new algorithm. The proposed method is tested on applications such as sparse principal component analysis and the densest $k$-subgraph problem. Extensive experiments on several synthetic and real-world large scale datasets demonstrate the competitive empirical performance of our method.

Affiliated with

Also associated with

No associations

Rating

Truncated Power Method for Sparse Eigenvalue Problems does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Truncated Power Method for Sparse Eigenvalue Problems, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Truncated Power Method for Sparse Eigenvalue Problems will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-484721