7d9a786a66950410VgnVCM100000c2b1d38dRCRDapproved/UMICH/stats/Home/News & Events/Statistics SeminarSeminar Series: Covariance Assisted Screening and Estimation###@###(Fri, 25 Oct 2013)Seminar Series: Covariance Assisted Screening and Estimation###@###(Fri, 25 Oct 2013)340 West Hallstats1382715000000138271500000011:30 AM<p><iframe width="300" height="169" src="//www.youtube.com/embed/CXtdZNclm1k?rel=0" frameborder="0" allowfullscreen></iframe></p> <p style=" line-height: 115%; margin-bottom: 10.0pt; margin-left: 0in; font-size: 11.0pt; margin-top: 0in; font-family: Calibri,sans-serif; margin-right: 0in;">We consider the problem of variable selection in the very challenging regime where the signals are rare and weak and columns of the design matrix are heavily correlated. We demonstrate that in the presence of rare/weak signals, many classical methods and ambitious contemporary algorithms face pitfalls. The situation is worsen in the presence of heavy correlations among design variables.</p> <p style=" line-height: 115%; margin-bottom: 10.0pt; margin-left: 0in; font-size: 11.0pt; margin-top: 0in; font-family: Calibri,sans-serif; margin-right: 0in;">We propose a new variable selection approach which we call Covariance Assisted Screening and Estimation (CASE). CASE is a multi-stage multivariate Screen and Clean algorithm. CASE has two layers of innovations. In the first layer, we alleviate the heavy correlations of the design variables by linear filtering and use the post-filtering model to construct a sparse graph. In the second layer, we use the sparse graph to guide both the screening and cleaning.&nbsp;</p> <p style=" line-height: 115%; margin-bottom: 10.0pt; margin-left: 0in; font-size: 11.0pt; margin-top: 0in; font-family: Calibri,sans-serif; margin-right: 0in;">We explain how CASE overcomes the well-known computational hurdle of multivariate screening.&nbsp; We also explain how CASE overcomes the so-called challenge of&nbsp; "signal cancellation", so its success is not tied to strong signals or any types of incoherence/irrepresentable conditions.</p> <p style=" line-height: 115%; margin-bottom: 10.0pt; margin-left: 0in; font-size: 11.0pt; margin-top: 0in; font-family: Calibri,sans-serif; margin-right: 0in;">We set up a theoretic framework where we show CASE obtains the optimal rate of convergence in terms of Hamming errors. We have successfully applied CASE to a long-memory time series and a change-point model, where the optimality is further investigated with the so-called notion of phase diagram.</p>Nmakingbzuniga13827237436474d9a786a66950410VgnVCM100000c2b1d38d____once11112newnewTracy Ke, Graduate Student, Princeton Universityhttp://orfe.princeton.edu/statlab/people/all