A D.C. Programming Approach to the Sparse Generalized Eigenvalue Problem

Statistics – Machine Learning

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

40 pages

Scientific paper

In this paper, we consider the sparse eigenvalue problem wherein the goal is to obtain a sparse solution to the generalized eigenvalue problem. We achieve this by constraining the cardinality of the solution to the generalized eigenvalue problem and obtain sparse principal component analysis (PCA), sparse canonical correlation analysis (CCA) and sparse Fisher discriminant analysis (FDA) as special cases. Unlike the $\ell_1$-norm approximation to the cardinality constraint, which previous methods have used in the context of sparse PCA, we propose a tighter approximation that is related to the negative log-likelihood of a Student's t-distribution. The problem is then framed as a d.c. (difference of convex functions) program and is solved as a sequence of convex programs by invoking the majorization-minimization method. The resulting algorithm is proved to exhibit \emph{global convergence} behavior, i.e., for any random initialization, the sequence (subsequence) of iterates generated by the algorithm converges to a stationary point of the d.c. program. The performance of the algorithm is empirically demonstrated on both sparse PCA (finding few relevant genes that explain as much variance as possible in a high-dimensional gene dataset) and sparse CCA (cross-language document retrieval and vocabulary selection for music retrieval) applications.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

A D.C. Programming Approach to the Sparse Generalized Eigenvalue Problem 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 A D.C. Programming Approach to the Sparse Generalized Eigenvalue Problem, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A D.C. Programming Approach to the Sparse Generalized Eigenvalue Problem will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-532055

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.