Stepwise Searching for Feature Variables in High-Dimensional Linear Regression

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

• Qiwei Yao, LSE
• Friday 30 January 2009, 16:00-17:00
• MR12, CMS, Wilberforce Road, Cambridge, CB3 0WB.

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

We investigate the classical stepwise forward and backward search methods for selecting sparse models in the context of linear regression with the number of candidate variables p greater than the number of observations n. Two types of new information criteria BICP and BICC are proposed to serve as the stopping rules in the stepwise searches, since the traditional information criteria such as BIC and AIC are designed for the cases with p LASSO selector. The consistency of the stepwise search is investigated when both $n$ and p tend to infinity. We show that a stepwise forward addition followed by a stepwise backward deletion, both controlled by a version of BICP , leads to a consistent estimated model under the sparse Riesz condition.

This talk is part of the Statistics series.

This talk is included in these lists:

• All CMS events
• All Talks (aka the CURE list)
• CMS Events
• Cambridge Forum of Science and Humanities
• Cambridge Language Sciences
• Cambridge talks
• Chris Davis' list
• DPMMS Lists
• DPMMS info aggregator
• DPMMS lists
• Guy Emerson's list
• Hanchen DaDaDash
• Interested Talks
• MR12, CMS, Wilberforce Road, Cambridge, CB3 0WB
• Machine Learning
• School of Physical Sciences
• Statistical Laboratory info aggregator
• Statistics
• Statistics Group
• bld31
• custom
• rp587

Note that ex-directory lists are not shown.