Least Squares After Model Selection in High-Dimensional Sparse Models

36 Pages Posted: 4 Apr 2010 Last revised: 18 Aug 2011

See all articles by Alexandre Belloni

Alexandre Belloni

Massachusetts Institute of Technology (MIT) - Operations Research Center

Victor Chernozhukov

Massachusetts Institute of Technology (MIT) - Department of Economics

Date Written: January 4, 2009

Abstract

In this paper we study post-model selection estimators which apply ordinary least squares (ols) to the model selected by first-step penalized estimators, typically lasso. It is well known that lasso can estimate the non-parametric regression function at nearly the oracle rate, and is thus hard to improve upon. We show that ols post lasso estimator performs at least as well as lasso in terms of the rate of convergence, and has the advantage of a smaller bias. Remarkably, this performance occurs even if the lasso-based model selection “fails” in the sense of missing some components of the “true” regression model. By the “true” model we mean here the best s-dimensional approximation to the nonparametric regression function chosen by the oracle. Furthermore, ols post lasso estimator can perform strictly better than lasso, in the sense of a strictly faster rate of convergence, if the lasso-based model selection correctly includes all components of the “true” model as a subset and also achieves sufficient sparsity. In the extreme case, when lasso perfectly selects the “true” model, the ols post lasso estimator becomes the oracle estimator. An important ingredient in our analysis is a new sparsity bound on the dimension of the model selected by lasso which guarantees that this dimension is at most of the same order as the dimension of the “true” model. Our rate results are non-asymptotic and hold in both parametric and nonparametric models. Moreover, our analysis is not limited to the lasso estimator acting as selector in the first step, but also applies to any other estimator, for example various forms of thresholded lasso, with good rates and good sparsity properties. Our analysis covers both traditional thresholding and a new practical, data-driven thresholding scheme that induces maximal sparsity subject to maintaining a certain goodness-of-fit. The latter scheme has theoretical guarantees similar to those of lasso or ols post lasso, but it dominates these procedures as well as traditional thresholding in a wide variety of experiments.

First arXiv version: December 2009.

Keywords: lasso, ols post lasso, post-model-selection estimators

JEL Classification: H12, J99, J07

Suggested Citation

Belloni, Alexandre and Chernozhukov, Victor, Least Squares After Model Selection in High-Dimensional Sparse Models (January 4, 2009). MIT Department of Economics Working Paper No. 10-5, Available at SSRN: https://ssrn.com/abstract=1582594 or http://dx.doi.org/10.2139/ssrn.1582594

Alexandre Belloni

Massachusetts Institute of Technology (MIT) - Operations Research Center ( email )

77 Massachusetts Avenue
Bldg. E 40-149
Cambridge, MA 02139
United States

Victor Chernozhukov (Contact Author)

Massachusetts Institute of Technology (MIT) - Department of Economics ( email )

50 Memorial Drive
Room E52-262f
Cambridge, MA 02142
United States
617-253-4767 (Phone)
617-253-1330 (Fax)

HOME PAGE: http://www.mit.edu/~vchern/