Lasso with convex loss: Model selection consistency and estimation |
| |
Authors: | Wojciech Rejchel |
| |
Institution: | 1. Faculty of Mathematics and Computer Science, Nicolaus Copernicus University, Toruń, Polandwrejchel@gmail.com |
| |
Abstract: | AbstractVariable selection is a fundamental challenge in statistical learning if one works with data sets containing huge amount of predictors. In this artical we consider procedures popular in model selection: Lasso and adaptive Lasso. Our goal is to investigate properties of estimators based on minimization of Lasso-type penalized empirical risk with a convex loss function, in particular nondifferentiable. We obtain theorems concerning rate of convergence in estimation, consistency in model selection and oracle properties for Lasso estimators if the number of predictors is fixed, i.e. it does not depend on the sample size. Moreover, we study properties of Lasso and adaptive Lasso estimators on simulated and real data sets. |
| |
Keywords: | Lasso Adaptive lasso Model selection Oracle property Convex loss function |
|
|