Multi-stage Dantzig selector

Advances in Neural Information Processing Systems 23: 24th Annual Conference on Neural Information Processing Systems 2010, NIPS 2010

Volumn , Issue , 2010, Pages

  Liu, Ji ^a   Wonka, Peter ^a   Ye, Jieping ^a  

^a ARIZONA STATE UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

FEATURE EXTRACTION; GAUSSIAN DISTRIBUTION; RECOVERY; SIGNAL RECONSTRUCTION;

CONDITION; DANTZIG SELECTOR; DESIGN MATRIX; FEATURE SELECTION PROBLEM; MULTI-STAGES; NOISE VECTORS; NOISY OBSERVATIONS; OBSERVATION VECTORS; SIGNAL FEATURES; SPARSE SIGNAL RECOVERIES;

ITERATIVE METHODS;

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

References (24)

1. P. J. Bickel, Y. Ritov, and A. B. Tsybakov. Simultaneous analysis of Lasso and Dantzig selector. Annals of Statistics, 37:1705-1732, 2009.
2. F. Bunea, A. Tsybakov, and M.Wegkamp. Sparsity oracle inequalities for the Lasso. Electronic Journal of Statistics, 2007.
3. T. Cai and L. Wang. Orthogonal matching pursuit for sparse signal reconvery. Technical Report, 2010.
4. 1 minimization. IEEE Transactions on Information Theory, 55(7):3388-3397, 2009.
5. 1 minimization. Annals of Statistics, 37:2145-2177, 2006.
6. E. J. Candes and T. Tao. Decoding by linear programming. IEEE Transactions on Information Theory, 51(12):4203-4215, 2005.
7. E. J. Candes and T. Tao. The Dantzig selector: Statistical estimation when p is much larger than n. Annals of Statistics, 35:2313, 2007.
8. D. L. Donoho, M. Elad, and V. N. Temlyakov. Stable recovery of sparse overcomplete representations in the presence of noise. IEEE Transactions on Information Theory, pages 6-18, 2006.
9. G. M. James, P. Radchenko, and J. Lv. DASSO: connections between the Dantzig selector and Lasso. Journal of The Royal Statistical Society Series B, 71(1):127-142, 2009.
10. V. Koltchinskii and M. Yuan. Sparse recovery in large ensembles of kernel machines on-line learning and bandits. COLT, pages 229-238, 2008.
11. K. Lounici. Sup-norm convergence rate and sign concentration property of Lasso and Dantzig esti mators. Electronic Journal of Statistics, 2:90-102, 2008.
12. N. Meinshausen, P. Bhlmann, and E. Zrich. High dimensional graphs and variable selection with the Lasso. Annals of Statistics, 34:1436-1462, 2006.
13. 1-regularized MLE. pages 1329-1336, 2008.
14. J. Romberg. The Dantzig selector and generalized thresholding. CISS, pages 22-25, 2008.
15. R. Tibshirani. Regression shrinkage and selection via the Lasso. Journal of the Royal Statistical Society: Series B, 58(1):267-288, 1996.
16. J. A. Tropp. Greed is good: Algorithmic results for sparse approximation. IEEE Transactions on Information Theory, 50:2231-2242, 2004.
17. 1-constrained quadratic programming (Lasso). IEEE Transactions on Information Theory, pages 2183-2202, 2009.
18. T. Zhang. Adaptive forward-backward greedy algorithm for sparse learning with linear models. NIPS, pages 1921-1928, 2008.
19. T. Zhang. On the consistency of feature selection using greedy least squares regression. Journal of Machine Learning Reserch, 10:555-568, 2009.
20. 1 regularization. Annals of Statistics, 37:2109, 2009.
21. T. Zhang. Sparse recovery with orthogonal matching pursuit under RIP. arXiv:1005.2249, 2010.
22. P. Zhao and B. Yu. On model selection consistency of Lasso. Journal of Machine Learning Reserch, 7:2541-2563, 2006.
23. S. Zhou. Thresholding procedures for high dimensional variable selection and statistical estimation. NIPS, pages 2304-2312, 2009.
24. H. Zou. The adaptive Lasso and its oracle properties. Journal of the American Statistical Association, 101:1418-1429, 2006.