Lower bounds for adaptive sparse recovery

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn , Issue , 2013, Pages 652-663

  Price, Eric ^a   Woodruff, David P ^b  

^a MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

^b IBM ALMADEN RESEARCH CENTER   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ADAPTIVITY; LINEAR MEASUREMENTS; LOWER BOUNDS; SPARSE RECOVERY; UPPER BOUND;

ALGORITHMS;

EID: 84876046308     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1137/1.9781611973105.47     Document Type: Conference Paper

References (25)

1. E. Arias-Castro, E.J. Candes, and M. Davenport. On the fundamental limits of adaptive sensing. Arxiv preprint arXiv:1111.4646, 2011.
2. A. Aldroubi, H. Wang, and K. Zarringhalam. Sequential adaptive compressed sampling via huffman codes. Preprint, 2008.
3. Ziv Bar-Yossef. The Complexity of Massive Data Set Computations. PhD thesis, UC Berkeley, 2002.
4. Ziv Bar-Yossef, T. S. Jayram, Ravi Kumar, and D. Sivakumar. An information statistics approach to data stream and communication complexity. J. Comput. Syst. Sci., 68(4):702-732, 2004.
5. Mark Braverman and Anup Rao. Information equals amortized communication. In STOC, 2011.
6. E.J. Candès and M.A. Davenport. How well can we estimate a sparse vector? Arxiv preprint arXiv:1104.5246, 2011.
7. R. Castro, J. Haupt, R. Nowak, and G. Raz. Finding needles in noisy haystacks. Proc. IEEE Conf. Acoustics, Speech, and Signal Proc., page 5133¡D0¿5136, 2008.
8. E. J. Candès, J. Romberg, and T. Tao. Stable signal recovery from incomplete and inaccurate measurements. Comm. Pure Appl. Math., 59(8):1208-1223, 2006.
9. K. Do Ba, P. Indyk, E. Price, and D. Woodruff. Lower bounds for sparse recovery. SODA, 2010.
10. D. L. Donoho. Compressed Sensing. IEEE Trans. Info. Theory, 52(4):1289-1306, Apr. 2006.
11. Anna C. Gilbert, Yi Li, Ely Porat, and Martin J. Strauss. Approximate sparse recovery: optimizing time and measurements. In STOC, pages 475-484, 2010.
12. Parikshit Gopalan, Raghu Meka, Omer Reingold, and David Zuckerman. Pseudorandom generators for combinatorial shapes. In STOC, pages 253-262, 2011.
13. J. Haupt, R. Baraniuk, R. Castro, and R. Nowak. Compressive distilled sensing. Asilomar, 2009.
14. J. Haupt, R. Castro, and R. Nowak. Adaptive sensing for sparse signal recovery. Proc. IEEE 13th Digital Sig. Proc./5th Sig. Proc. Education Workshop, page 702¡D0¿707, 2009.
15. H. Hassanieh, P. Indyk, D. Katabi, and E. Price. Nearly optimal sparse Fourier transform. STOC, 2012.
16. P. Indyk, E. Price, and D.P. Woodruff. On the power of adaptivity in sparse recovery. FOCS, 2011.
17. T.S. Jayram. Unpublished manuscript, 2002.
18. S. Ji, Y. Xue, and L. Carin. Bayesian compressive sensing. Signal Processing, IEEE Transactions on, 56(6):2346-2356, 2008.
19. Eyal Kushilevitz and Noam Nisan. Communication complexity. Cambridge University Press, 1997.
20. D. M. Malioutov, S. Sanghavi, and A. S. Willsky. Compressed sensing with sequential observations. ICASSP, 2008.
21. S. Muthukrishnan. Data streams: Algorithms and applications). FTTCS, 2005.
22. Pollard. Total variation distance between measures. 2005. http://www.stat.yale.edu/pollard/Courses/607.spring05/handouts/Totalvar.pdf.
23. Eric Price and David P. Woodruff. (1+eps)-approximate sparse recovery. CoRR, abs/1110.4414, 2011.
24. N. Shental, A. Amir, and Or Zuk. Identification of rare alleles and their carriers using compressed se(que)nsing. Nucleic Acids Research, 38(19):1-22, 2010.
25. Michael E. Saks and Xiaodong Sun. Space lower bounds for distance approximation in the data stream model. In Proceedings of the 34th Annual ACM Symposium on Theory of Computing (STOC), pages 360-369, 2002.