On Model Selection Consistency of Lasso
The Journal of Machine Learning Research
Signal Recovery From Random Measurements Via Orthogonal Matching Pursuit
IEEE Transactions on Information Theory
| Hi-index | 0.03 |
A selection procedure with no optimization step called LOLA, for Learning Out of Leaders with Adaptation is proposed. LOLA is an auto-driven algorithm with two thresholding steps. The consistency of the LOL procedure (the non adaptive version of LOLA) is proved under sparsity conditions and simulations are conducted to illustrate the practical good performances of LOLA. The behavior of the algorithm is studied when instrumental variables are artificially added without a priori significant connection to the model. Finally, the problem of empirically verifying the conditional convergence hypothesis used in economics concerning the growth rate is studied. To avoid unnecessary discussion about the choice and the pertinence of instrumental variables, the model is embedded in a very high dimensional setting. Using the LOLA algorithm, a solution for modeling the link between the growth rate and the initial level of the gross domestic product is provided and the convergence hypothesis is empirically proved.