We consider the least-square linear regression problem with regularization by the l1-norm, a problem usually referred to as the Lasso. In this paper, we present a detailed asymptotic analysis of model consistency of the Lasso. For various decays of the regularization parameter, we compute asymptotic equivalents of the probability of correct model selection (i.e., variable selection). For a specific rate decay, we show that the Lasso selects all the variables that should enter the model with probability tending to one exponentially fast, while it selects all other variables with strictly positive probability. We show that this property implies that if we run the Lasso for several bootstrapped replications of a given sample, then intersecting the supports of the Lasso bootstrap estimates leads to consistent model selection. This novel variable selection algorithm, referred to as the Bolasso, is compared favorably to other linear regression methods on synthetic data and datasets from the UCI machine learning repository.

本文考虑了最小二乘线性回归问题，通过L1范数进行正则化。通过详细的渐近分析，计算了正确的模型选择（即变量选择）的概率的渐近等价。提出了一种名为Bolasso的变量选择算法，并在合成数据和UCI机器学习仓库中的数据集上进行了比较。

Bolasso: 通过自助法实现模型一致的Lasso估计