University of Cambridge > > Statistics > Sparse CCA: Statistical and Computational Limits

Sparse CCA: Statistical and Computational Limits

Add to your list(s) Download to your calendar using vCal

If you have a question about this talk, please contact .

I will introduce the problem of sparse canonical correlation analysis (sparse CCA ). The first part of the talk will focus on the statistical side. I will argue that sparse CCA has an intrinsic difference from the well studied sparse PCA problem because of the presence of high-dimensional nuisance parameters, namely, the marginal covariance matrices. A somewhat surprising result we derived shows that the minimax rate of sparse CCA is independent of the structure of the marginal covariance matrices. The second part of the talk will focus on the computational side. A novel algorithm is proposed to achieve the minimax rate adaptively under an extra sample size condition. I will present a computational lower bound argument to show that such condition is necessary for all polynomial-time algorithms under the Planted Clique hypothesis. A novel reduction procedure is constructed in order that the lower bound is faithful to the Gaussianity of the model. A byproduct of this argument also provides a computational lower bound for sparse PCA under Gaussian spiked covariance model.

This talk is part of the Statistics series.

Tell a friend about this talk:

This talk is included in these lists:

Note that ex-directory lists are not shown.


© 2006-2024, University of Cambridge. Contact Us | Help and Documentation | Privacy and Publicity