A comparative framework for Preconditioned Lasso algorithms

Advances in Neural Information Processing Systems

Volumn , Issue , 2013, Pages

  Wauthier, Fabian L ^a   Jojic, Nebojsa ^b   Jordan, Michael I ^c  

^a UNIVERSITY OF OXFORD   (United Kingdom)

^b MICROSOFT RESEARCH   (United States)

^c UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

MULTIVARIANT ANALYSIS;

COVARIATES; MULTIVARIATE DATA ANALYSIS; PENALTY PARAMETERS;

ALGORITHMS;

EID: 84898935613     PISSN: 10495258     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (15)

1. D.L. Donoho, M. Elad, and V.N. Temlyakov. Stable recovery of sparse overcomplete representations in the presence of noise. Information Theory, IEEE Transactions on, 52(1):6-18, 2006.
2. J. Fan and R. Li. Variable selection via nonconcave penalized likelihood and its oracle properties. Journal of the American Statistical Association, 96:1348-1360, 2001.
3. J.J. Fuchs. Recovery of exact sparse representations in the presence of bounded noise. Information Theory, IEEE Transactions on, 51(10):3601-3608, 2005.
4. H.-C. Huang, N.-J. Hsu, D.M. Theobald, and F.J. Breidt. Spatial Lasso with applications to GIS model selection. Journal of Computational and Graphical Statistics, 19(4):963-983, 2010.
5. J.C. Huang and N. Jojic. Variable selection through Correlation Sifting. In V. Bafna and S.C. Sahinalp, editors, RECOMB, volume 6577 of Lecture Notes in Computer Science, pages 106-123. Springer, 2011.
6. J. Jia and K. Rohe. "Preconditioning" to comply with the irrepresentable condition. 2012.
7. N. Meinshausen. Lasso with relaxation. Technical Report 129, Eidgenössische Technische Hochschule, Zürich, 2005.
8. N. Meinshausen and P. Bühlmann. High-dimensional graphs and variable selection with the Lasso. Annals of Statistics, 34(3):1436-1462, 2006.
9. D. Paul, E. Bair, T. Hastie, and R. Tibshirani. " Preconditioning" for feature selection and regression in high-dimensional problems. Annals of Statistics, 36(4):1595-1618, 2008.
10. R. Tibshirani. Regression shrinkage and selection via the Lasso. Journal of the Royal Statistical Society, Series B, 58(1):267-288, 1994.
11. R.J. Tibshirani. The solution path of the Generalized Lasso. Stanford University, 2011.
12. M.J. Wainwright. Sharp thresholds for high-dimensional and noisy sparsity recovery using ℓ1-constrained quadratic programming (Lasso). IEEE Transactions on Information Theory, 55(5):2183-2202, 2009.
13. P. Zhao and B. Yu. On model selection consistency of Lasso. Journal of Machine Learning Research, 7:2541-2563, 2006.
14. H. Zou. The Adaptive Lasso and its oracle properties. Journal of the American Statistical Association, 101:1418-1429, 2006.
15. H. Zou and T. Hastie. Regularization and variable selection via the Elastic Net. Journal of the Royal Statistical Society, Series B, 67:301-320, 2005.