Richard Lawrence, Claudia Perlich, et al.
IBM Systems Journal
The Lasso achieves variance reduction and variable selection by solving an ℓ1-regularized least squares problem. Huang (2003) claims that 'there always exists an interval of regularization parameter values such that the corresponding mean squared prediction error for the Lasso estimator is smaller than for the ordinary least square estimator'. This result is correct. However, its proof in Huang (2003) is not. This paper presents a corrected proof of the claim, which exposes and uses some interesting fundamental properties of the Lasso.
Richard Lawrence, Claudia Perlich, et al.
IBM Systems Journal
Saharon Rosset, Claudia Perlich, et al.
KAIS
Trevor Hastie, Saharon Rosset, et al.
JMLR
Prem Melville, Saharon Rosset, et al.
KDD 2008