On the conditions used to prove oracle results for the lasso

Electronic Journal of Statistics

Volumn 3, Issue , 2009, Pages 1360-1392

  Van de Geer, Sara A ^a   Bühlmann, Peter ^a  

^a ETH ZURICH   (Switzerland)

Author keywords

Coherence; Compatibility; Irrepresentable condition; Lasso; Restricted eigenvalue; Restricted isometry; Sparsity

Indexed keywords

EID: 77955054299     PISSN: 19357524     EISSN: None     Source Type: Journal    
DOI: 10.1214/09-EJS506     Document Type: Article

References (24)

1. Bertsimas, D. and Tsitsiklis, J. (1997). Introduction to linear optimization. Athena Scientific Belmont, MA.
2. Bickel, P., Ritov, Y. and Tsybakov, A. (2009). Simultaneous anal-ysis of Lasso and Dantzig selector. Annals of Statistics 37 1705-1732.
3. Bunea, F., Tsybakov, A. and Wegkamp, M. (2007a). Aggregation for Gaussian regression. Annals of Statistics 35 1674.
4. Bunea, F., Tsybakov, A. and Wegkamp, M. (2007c). Sparsity ora-cle inequalities for the Lasso. Electronic Journal of Statistics 1 169-194.
5. Bunea, F., Tsybakov, A. and Wegkamp, M. (2007b). Sparse Density Estimation with ℓ1 Penalties. In Learning Theory 20th Annual Conference on Learning Theory, COLT 2007, San Diego, CA, USA, June 13-15, 2007: Proceedings 530. Springer.
6. Cai, T., Wang, L. and Xu, G. (2009a). Shifting inequality and recovery of sparse signals. IEEE Transactions on Signal Processing, to appear.
7. Cai, T., Wang, L. and Xu, G. (2009b). Stable recovery of sparse signals and an oracle inequality. Preprint.
8. Cai, T., Xu, G. and Zhang, J. (2009). On recovery of sparse signals via ℓ1 minimization. IEEE Transactions on Information Theory 55 3388-3397.
9. Candès, E. and Plan, Y. (2009). Near-ideal model selection by ℓ1 mini-mization. Annals of Statistics 37 2145-2177.
10. Candès, E. and Tao, T. (2005). Decoding by linear programming. IEEE Transactions on Information Theory 51 4203-4215.
11. Candès, E. and Tao, T. (2007). The Dantzig selector: statistical esti-mation when p is much larger than n. Annals of Statistics 35 2313-2351.
12. Koltchinskii, V. (2009a). Sparsity in penalized empirical risk minimiza-tion. Annales de l’Institut Henri Poincaré, Probabilités et Statistiques 45 7-57.
13. Koltchinskii, V. (2009b). The Dantzig selector and sparsity oracle in-equalities. Bernoulli 15 799-828.
14. Lounici, K. (2008). Sup-norm convergence rate and sign concentration property of Lasso and Dantzig estimators. Electronic Journal of Statistics 2 90-102.
15. Meinshausen, N. and Bühlmann, P. (2006). High-dimensional graphs and variable selection with the Lasso. Annals of Statistics 34 1436-1462.
16. Meinshausen, N. and Yu, B. (2009). Lasso-type recovery of sparse rep-resentations for high-dimensional data. Annals of Statistics 37 246-270.
17. Parter, S. (1961). Extreme eigenvalues of Toeplitz forms and applications to elliptic difference equations. Transactions of the American Mathematical Society 99 153-192.
18. van de Geer, S. (2007). The deterministic Lasso. In JSM proceedings, (seealso http://stat.ethz.ch/research/research_reports/2007/140). American Statistical Association.
19. van de Geer, S. (2008). High-dimensional generalized linear models and the Lasso. Annals of Statistics 36 614-645.
20. Wainwright, M. (2009). Sharp thresholds for high-dimensional and noisy sparsity recovery using ℓ1-constrained quadratic programming (Lasso). IEEE Transactions on Information Theory 55 2183-2202.
21. Zhang, C.-H. and Huang, J. (2008). The sparsity and bias of the Lasso selection in high-dimensional linear regression. Annals of Statistics 36 1567-1594.
22. Zhang, T. (2009). Some sharp performance bounds for least squaresregression with L1 regularization. Annals of Statistics 37 2109-2144.
23. Zhao, P. and Yu, B. (2006). On model selection consistency of Lasso. Journal of Machine Learning Research 7 2541-2563.
24. Zou, H. (2006). The adaptive Lasso and its oracle properties. Journal of the American Statistical Association 101 1418-1429.