[Statlist] Next talk: Friday, November 14, 2014 with Harrison Zhou (Yale University, New Haven, CT)

Cecilia Rey rey @end|ng |rom @t@t@m@th@ethz@ch
Mon Nov 10 11:35:35 CET 2014


E-mail from the  Statlist using stat.ch  mailing list
_________________________________________________
ETH and University of Zurich

Organisers:
Proff. P. B�hlmann - L. Held - T. Hothorn - H.R. Kuensch - M. Maathuis -
N. Meinshausen - S. van de Geer - M. Wolf

****************************************************************

We are glad to announce the following talk:

Friday, November 14, 2014 at 15.15h  ETH Zurich HG G 19.1
with Harrison Zhou (Yale University, New Haven, CT)                                                ***************************************************************

Title:
Sparse Canonical Correlation Analysis: Minimaxity and Adaptivity

Abstract:
Canonical correlation analysis is a widely used multivariate statistical technique for exploring the relation between two sets of variables. In this talk we consider the problem of estimating the leading canonical correlation directions in high dimensional settings. Recently, under the assumption that the leading canonical correlation directions are sparse, various procedures have been proposed for many high dimensional applications involving massive data sets. However, there has been few theoretical justification available in the literature. In this talk, we establish rate-optimal non-asymptotic minimax estimation with respect to an appropriate loss function for a wide range of model spaces. Two interesting phenomena are observed. First, the minimax rates are not affected by the presence of nuisance parameters, namely the covariance matrices of the two sets of random variables, though they need to be estimated in the canonical correlation analysis problem. Second, we allow the presence of the residual canonical correlation directions. However, they do not influence the minimax rates under a mild condition on eigengap. A generalized sin-theta theorem and an empirical process bound for Gaussian quadratic forms under rank constraint are used to establish the minimax upper bounds, which may be of independent interest. 

If time permits, we will discuss a computationally efficient two-stage estimation procedure which consists of a convex programming  based initialization stage and a group Lasso based refinement stage, and show some encouraging numerical results on simulated data sets and a breast cancer data set.

*******************************************************************************************************
This abstract is also to be found under the following link: http://stat.ethz.ch/events/research_seminar
*******************************************************************************************************

Statlist mailing list
Statlist using stat.ch
https://stat.ethz.ch/mailman/listinfo/statlist

_______________________________________________


	[[alternative HTML version deleted]]




More information about the Statlist mailing list