Combinatorial selection and least absolute shrinkage via the Clash algorithm

IEEE International Symposium on Information Theory - Proceedings

Volumn , Issue , 2012, Pages 2216-2220

  Kyrillidis, Anastasios ^a   Cevher, Volkan ^a  

^a EPFL   (Switzerland)

Author keywords

[No Author keywords available]

Indexed keywords

COMPRESSIVE SENSING; DATA ERRORS; LEARNING PERFORMANCE; LEAST ABSOLUTE SHRINKAGE AND SELECTION OPERATORS; SELECTION PROCESS; SPARSE ESTIMATION;

INFORMATION THEORY;

SHRINKAGE;

EID: 84867499523     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ISIT.2012.6283847     Document Type: Conference Paper

References (24)

1. R. Tibshirani. Regression shrinkage and selection via the lasso. J. Royal. Statist. Soc B, 58(1):267-288, 1996.
2. 1-ball for learning in high dimensions. In ICML, 2008.
3. P.J. Bickel, Y. Ritov, and A.B. Tsybakov. Simultaneous analysis of lasso and dantzig selector. The Annals of Statistics, 37(4):1705-1732, 2009.
4. 1-constrained quadratic programming (Lasso). IEEE Trans. on Info. Theory, 2009.
5. P. Zhao and B. Yu. On model selection consistency of lasso. The Journal of Machine Learning Research, 7:2541-2563, 2006.
6. R. Jenatton, J.-Y. Audibert, and F. Bach. Structured variable selection with sparsity-inducing norms. The Journal of Machine Learning Research, 2777-2824, 2011.
7. R.G. Baraniuk, V. Cevher, M.F. Duarte, and C. Hegde. Model-based compressive sensing. IEEE Trans. on Info. Theory, 2010.
8. E. J. Candès and T. Tao. Near optimal signal recovery from random projections: Universal encoding strategies? IEEE Trans. on Info. Theory, 2006.
9. J.A. Tropp. Algorithms for simultaneous sparse approximation. part ii: Convex relaxation. Signal Processing, 86(3):589-602, 2006.
10. L. Jacob, G. Obozinski, and J.P. Vert. Group lasso with overlap and graph lasso. In ICML, 2009.
11. F. Bach. Structured sparsity-inducing norms through submodular functions. In Advances in Neural Information Processing Systems, 2010.
12. A. Kyrillidis and V. Cevher. Sublinear time, approximate model-based sparse recovery for all. EPFL Technical report, 2011.
13. G.L. Nemhauser and L.A. Wolsey. Integer and combinatorial optimization, volume 18. Wiley New York, 1988.
14. C. Hegde, M.F. Duarte, and V. Cevher. Compressive sensing recovery of spike trains using a structured sparsity model. SPARS, 2009.
15. J. Friedman, T. Hastie, and R. Tibshirani. A note on the group lasso and a sparse group lasso. Arxiv preprint arXiv:1001.0736, 2010.
16. A. Kyrillidis and V. Cevher. Combinatorial selection and least absolute shrinkage via the CLASH algorithm. EPFL Technical Report, 2011.
17. D. Needell and J. Tropp. CoSaMP: Iterative signal recovery from incomplete and inaccurate samples. Applied and Computational Harmonic Analysis, 26(3):301-312, 2008.
18. W. Dai and O. Milenkovic. Subspace pursuit for compressive sensing signal reconstruction. IEEE Trans. on Inf. Theory, 2009.
19. D. L. Donoho and J. Tanner. Neighborliness of randomly projected simplices in high dimensions. Proceedings of the National Academy of Sciences, 102, 2005.
20. R. Ward. Compressed sensing with cross validation. IEEE Trans. on Info. Theory, 2009.
21. S. Foucart. Sparse recovery algorithms: sufficient conditions in terms of restricted isometry constants. In Proceedings of the 13th International Conference on Approximation Theory, 2010.
22. S. S. Chen, D. L. Donoho, and M. A. Saunders. Atomic decomposition by basis pursuit. SIAM Journal on Scientific Computing, 20:33-61, 1998.
23. E. van den Berg and M. P. Friedlander. Probing the pareto frontier for basis pursuit solutions. SIAM Journal on Scientific Computing, 2008.
24. V. Cevher, P. Indyk, C. Hegde, and R.G. Baraniuk. Recovery of clustered sparse signals from compressive measurements. SAMPTA, 2009.