Compressive binary search

IEEE International Symposium on Information Theory - Proceedings

Volumn , Issue , 2012, Pages 1827-1831

  Davenport, Mark A ^a   Arias Castro, Ery ^b  

^a STANFORD UNIVERSITY   (United States)

^b UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

BINARY SEARCH; HIGH-DIMENSIONAL; LINEAR MEASUREMENTS; LOWER BOUNDS; NON-ASYMPTOTIC; NONZERO ENTRIES; OPTIMAL PERFORMANCE; RECURSIVE BISECTION;

INFORMATION THEORY;

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

References (19)

1. R. Baraniuk, "Compressive sensing," IEEE Signal Processing Mag., vol. 24, no. 4, pp. 118-120, 124, 2007.
2. E. Candès and M. Wakin, "An introduction to compressive sampling," IEEE Signal Processing Mag., vol. 25, no. 2, pp. 21-30, 2008.
3. N. Verzelen, "Minimax risks for sparse regressions: Ultra-high-dimensional phenomenons," Electron. J. Statist., vol. 6, pp. 38-90, 2012.
4. M. Iwen, "Group testing strategies for recovery of sparse signals in noise," in Proc. Asilomar Conf. Signals, Systems, and Computers, Pacific Grove, CA, Nov. 2009.
5. S. Aeron, V. Saligrama, and M. Zhao, "Information theoretic bounds for compressed sensing," IEEE Trans. Inform. Theory, vol. 56, no. 10, pp. 5111-5130, 2010.
6. M. Wainwright, "Information-theoretic limits on sparsity recovery in the high-dimensional and noisy setting," IEEE Trans. Inform. Theory, vol. 55, no. 12, pp. 5728-5741, 2009.
7. T. Cai and L. Wang, "Orthogonal matching pursuit for sparse signal recovery with noise," IEEE Trans. Inform. Theory, vol. 57, no. 7, pp. 4680-4688, 2011.
8. P. Zhao and B. Yu, "On model selection consistency of lasso," J. Mach. Learn. Res., vol. 7, pp. 2541-2563, 2006.
9. 1 minimization," Ann. Stat., vol. 37, no. 5A, pp. 2145-2177, 2009.
10. E. Candès and M. Davenport, "How well can we estimate a sparse vector?" Arxiv preprint arXiv:1104.5246, 2011.
11. E. Arias-Castro, E. J. Candès, and M. A. Davenport, "On the fundamental limits of adaptive sensing," Arxiv preprint arXiv:1111.4646, 2011.
12. P. Massart, Concentration inequalities and model selection, ser. Lecture Notes in Mathematics. Berlin: Springer, 2007, vol. 1896.
13. T. Cover and J. Thomas, Elements of information theory. Hoboken, NJ: Wiley-Interscience, 2006.
14. E. Lehmann and J. Romano, Testing statistical hypotheses, ser. Springer Texts in Statistics. New York: Springer, 2005.
15. J. Haupt, R. Nowak, and R. Castro, "Adaptive sensing for sparse signal recovery," in Proc. Digital Signal Processing Workshop, Marco Island, FL, Jan. 2009.
16. J. Haupt, R. Baraniuk, R. Castro, and R. Nowak, "Compressive distilled sensing: Sparse recovery using adaptivity in compressive measurements," in Proc. Asilomar Conf. Signals, Systems, and Computers, Pacific Grove, CA, Nov. 2009.
17. R. Castro, J. Haupt, R. Nowak, and G. Raz, "Finding needles in noisy haystacks," in Proc. IEEE Int. Conf. Acoust., Speech, and Signal Processing (ICASSP), Las Vegas, NV, Apr. 2008.
18. S. Ji, Y. Xue, and L. Carin, "Bayesian compressive sensing," IEEE Trans. Signal Processing, vol. 56, no. 6, pp. 2346-2356, 2008.
19. M. Malloy and R. Nowak, "Near-optimal compressive binary search," Arxiv preprint arXiv:1203.1804, 2012.