Increasing Feature Selection Accuracy for L1 Regularized Linear Models
Abhishek Jaiantilal and Gregory Grudic;
JMLR W&P 10:86-96, 2010.
Abstract
L1 (also referred to as the 1-norm or Lasso) penalty based formulations have been shown to be e ective in problem domains when noisy features are present. However, the L1 penalty does not give favorable asymptotic properties with respect to feature selection, and has been shown to be inconsistent as a feature selection estimator; e.g. when noisy features are correlated with the relevant features. This can a ect the estimation of the correct feature set, in certain domains like robotics, when both the number of examples and the number of features are large. The weighted lasso penalty by (Zou, 2006) has been proposed to rectify this problem of correct estimation of the feature set. This paper proposes a novel method for identifying problem specific L1 feature weights by utilizing the results from (Zou, 2006) and (Rocha et al., 2009) and is applicable to regression and classification algorithms. Our method increases the accuracy of L1 penalized algorithms through randomized experiments on subsets of the training data as a fast pre-processing step. We show experimental and theoretical results supporting the ecacy of the proposed method on two L1 penalized classification algorithms.
