On Model Selection Consistency of Lasso
The Journal of Machine Learning Research
Multiplicative Updates for Nonnegative Quadratic Programming
Neural Computation
IEEE Transactions on Information Theory
| Hi-index | 0.03 |
This paper proposes the nonnegative-lasso method for variable selection in high dimensional sparse linear regression models with the nonnegative constraints on the coefficients. This method is an extension of Lasso and is shown to have variable selection consistency and estimation consistency under certain condition similar to Irrepresentable Condition in Lasso. To get the solution of the nonnegative-lasso, many algorithms such as Lars, coordinate decent can be used, among which multiplicative updates approach is preferred since it is faster and simpler. The constrained index tracking problem in stock market without short sales is studied in the latter part. The tracking results indicate that nonnegative-lasso can get small tracking error and is successful in assets selection.