Timezone: »
Poster
Fantope Projection and Selection: A near-optimal convex relaxation of sparse PCA
Vincent Vu · Juhee Cho · Jing Lei · Karl Rohe
Sat Dec 07 07:00 PM -- 11:59 PM (PST) @ Harrah's Special Events Center, 2nd Floor #None
We propose a novel convex relaxation of sparse principal subspace estimation based on the convex hull of rank-$d$ projection matrices (the Fantope). The convex problem can be solved efficiently using alternating direction method of multipliers (ADMM). We establish a near-optimal convergence rate, in terms of the sparsity, ambient dimension, and sample size, for estimation of the principal subspace of a general covariance matrix without assuming the spiked covariance model. In the special case of $d=1$, our result implies the near- optimality of DSPCA even when the solution is not rank 1. We also provide a general theoretical framework for analyzing the statistical properties of the method for arbitrary input matrices that extends the applicability and provable guarantees to a wide array of settings. We demonstrate this with an application to Kendall's tau correlation matrices and transelliptical component analysis.
Author Information
Vincent Vu (Ohio State University)
Juhee Cho (UW-Madison)
Jing Lei (CMU)
Karl Rohe (UW-Madison)
More from the Same Authors
-
2018 Poster: Understanding Regularized Spectral Clustering via Graph Conductance »
Yilin Zhang · Karl Rohe -
2013 Poster: Regularized Spectral Clustering under the Degree-Corrected Stochastic Blockmodel »
Tai Qin · Karl Rohe -
2011 Poster: Differentially Private M-Estimators »
Jing Lei -
2008 Poster: Nonparametric sparse hierarchical models describe V1 fMRI responses to natural images »
Pradeep Ravikumar · Vincent Vu · Bin Yu · Thomas Naselaris · Kendrick Kay · Jack Gallant -
2008 Spotlight: Nonparametric sparse hierarchical models describe V1 fMRI responses to natural images »
Pradeep Ravikumar · Vincent Vu · Bin Yu · Thomas Naselaris · Kendrick Kay · Jack Gallant