Estimating unknown sparsity in compressed sensing

30th International Conference on Machine Learning, ICML 2013

Volumn , Issue PART 2, 2013, Pages 1254-1262

  Lopes, Miles E ^a  

^a UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ESTIMATION; LEARNING SYSTEMS; MATRIX ALGEBRA; SIGNAL RECONSTRUCTION;

COMPRESSIVE SENSING; CONFIDENCE INTERVAL; ESTIMATION PROCEDURES; LINEAR MEASUREMENTS; LOWER BOUNDS; MATRIX RECOVERY; SIGNAL DIMENSIONS; STABLE MEASURES;

RISK PERCEPTION;

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

References (28)

1. Arias-Castro, E., Candès, E. J., and Davenport, M. On the fundamental limits of adaptive sensing. Arxiv preprint arXiv:1111.4646, 2011.
2. Cai, T. T., Wang, L., and Xu, G. New bounds for restricted isometry constants. Information Theory, IEEE Transactions on, 56(9), 2010.
3. Candès, E. J. Compressive sampling. In Proceedings oh the International Congress of Mathematicians: Madrid, August 22-30, 2006: invited lectures, pp. 1433-1452, 2006.
4. Candès, E. J. and Plan, Y. Tight oracle inequalities for low-rank matrix recovery from a minimal number of noisy random measurements. IEEE Transactions on Information Theory, 57(4):2342-2359, 2011.
5. Candès, E. J., Romberg, J.K., and Tao, T. Stable signal recovery from incomplete and inaccurate measurements. Communications on pure and applied mathematics, 59 (8):1207-1223, 2006. (Pubitemid 43988295)
6. Chandrasekaran, V., Recht, B., Parrilo, P. A., and Willsky, A. S. The convex algebraic geometry of linear inverse problems. In Communication, Control, and Computing (Allerton), 2010 48th Annual Allerton Conference on, pp. 699-703. IEEE, 2010.
7. d'Aspremont, A. and El Ghaoui, L. Testing the nullspace property using semidefinite programming. Mathematical programming, 127(1):123-144, 2011.
8. Davenport, M. A., Duarte, M. F., Eldar, Y. C., and Kutyniok, G. Introduction to compressed sensing. Preprint, 93, 2011.
9. Donoho, D. L. Compressed sensing. IEEE Transactions on Information Theory, 52(4):1289-1306, 2006.
10. Eldar, Y. C. Generalized sure for exponential families: Applications to regularization. IEEE Transactions on Signal Processing, 57(2):471-481, 2009.
11. Fama, E. F. and Roll, Richard. Parameter estimates for symmetric stable distributions. Journal of the American Statistical Association, 66(334):331-338, 1971.
12. Hoyer, P.O. Non-negative matrix factorization with sparseness constraints. The Journal of Machine Learning Research, 5:1457-1469, 2004.
13. Hurley, N. and Rickard, S. Comparing measures of sparsity. IEEE Transactions on Information Theory, 55(10):4723-4741, 2009.
14. Indyk, P. Stable distributions, pseudorandom generators, embeddings, and data stream computation. Journal of the ACM (JACM), 53(3):307-323, 2006. (Pubitemid 44180740)
15. 1 minimization. Mathematical programming, 127(1):57-88, 2011.
16. Li, P., Hastie, T., and Church, K. Nonlinear estimators and tail bounds for dimension reduction in l 1 using cauchy random projections. Journal of Machine Learning Research, pp. 2497-2532, 2007. (Pubitemid 350046191)
17. Lopes, M. E., Jacob, L., and Wainwright, M.J. A more powerful two-sample test in high dimensions using random projection. In NIPS 24, pp. 1206-1214. 2011.
18. Malioutov, D. M., Sanghavi, S., and Willsky, A. S. Compressed sensing with sequential observations. In IEEE International Conference on Acoustics, Speech and Signal Processing, 2008., pp. 3357-3360. IEEE, 2008.
19. Rigamonti, R., Brown, M. A., and Lepetit, V. Are sparse representations really relevant for image classification? In Computer Vision and Pattern Recognition (CVPR), 2011 IEEE Conference on, pp. 1545-1552. IEEE, 2011.
20. Rudelson, M. and Vershynin, R. Sampling from large matrices: An approach through geometric functional analysis. Journal of the ACM (JACM), 54(4):21, 2007.
21. Shi, Q., Eriksson, A., van den Hengel, A., and Shen, C. Is face recognition really a compressive sensing problem? In Computer Vision and Pattern Recognition (CVPR), 2011 IEEE Conference on, pp. 553-560. IEEE, 2011.
22. Tang, G. and Nehorai, A. The stability of low-rank matrix reconstruction: a constrained singular value view. arXiv:1006.4088, submitted to IEEE Transactions on Information Theory, 2010.
23. Tang, G. and Nehorai, A. Performance analysis of sparse recovery based on constrained minimal singular values. IEEE Transactions on Signal Processing, 59(12):5734-5745, 2011.
24. van den Berg, E. and Friedlander, M. P. SPGL1: A solver for large-scale sparse reconstruction, June 2007. http://www.cs.ubc.ca/labs/scl/spgl1.
25. van den Berg, E. and Friedlander, M. P. Probing the pareto frontier for basis pursuit solutions. SIAM Journal on Scientific Computing, 31(2):890-912, 2008. doi: 10.1137/080714488. URL http://link.aip.org/link/?SCE/31/890.
26. Vershynin, R. Introduction to the non-asymptotic analysis of random matrices. Arxiv preprint arxiv:1011.3027, 2010.
27. Ward, R. Compressed sensing with cross validation. IEEE Transactions on Information Theory, 55(12):5773-5782, 2009.
28. Zolotarev, V. M. One-dimensional stable distributions, volume 65. Amer Mathematical Society, 1986.