On the fundamental limits of adaptive sensing

IEEE Transactions on Information Theory

Volumn 59, Issue 1, 2013, Pages 472-481

  Arias Castro, Ery ^a   Candes, Emmanuel J ^b   Davenport, Mark A ^c  

^a UNIVERSITY OF CALIFORNIA   (United States)

^b STANFORD UNIVERSITY   (United States)

^c GEORGIA INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

Adaptive sensing; compressed sensing; hypothesis tests; information bounds; sparse signal estimation; support recovery

Indexed keywords

ADAPTIVE SENSING; COMPRESSIVE SENSING; HYPOTHESIS TESTS; INFORMATION BOUNDS; SPARSE SIGNALS;

INFORMATION THEORY;

COMPUTER APPLICATIONS;

EID: 84871766619     PISSN: 00189448     EISSN: None     Source Type: Journal    
DOI: 10.1109/TIT.2012.2215837     Document Type: Article

References (31)

1. E. Candès, J. Romberg, and T. Tao, "Robust uncertainty principles: Exact signal reconstruction from highly incomplete frequency information," IEEE Trans. Inf. Theory, vol. 52, no. 2, pp. 489-509, Feb. 2006.
2. E. Candès and T. Tao, "Near-optimal signal recovery fromrandom projections: Universal encoding strategies?," IEEE Trans. Inf. Theory, vol. 52, no. 12, pp. 5406-5425, Dec. 2006.
3. D. Donoho, "Compressed sensing," IEEE Trans. Inf. Theory, vol. 52, no. 4, pp. 1289-1306, Apr. 2006.
4. E. Candès and T. Tao, "The Dantzig Selector: Statistical estimation when is much larger than, " Ann. Statist., vol. 35, no. 6, pp. 2313-2351, 2007.
5. R. Tibshirani, "Regression shrinkage and selection via the lasso," J. Roy. Statist. Soc. Ser. B, vol. 58, no. 1, pp. 267-288, 1996.
6. E. Candès and M. Davenport, "How well can we estimate a sparse vector?," Appl. Comput. Harmon. Anal., to be published.
7. T. Cover and J. Thomas, Elements of Information Theory. Hoboken, NJ: Wiley-Interscience, 2006.
8. A. Tsybakov, Introduction to Nonparametric Estimation. NewYork: Springer-Verlag, 2009, Springer Series in Statistics.
9. B. Yu, "Assouad, Fano, and Le Cam," in Festschrift for Lucien Le Cam. New York: Springer-Verlag, 1997, pp. 423-435.
10. R. Castro and R. Nowak, "Minimax bounds for active learning," IEEE Trans. Inf. Theory, vol. 54, no. 5, pp. 2339-2353, May 2008.
11. P. Rigollet and A. Zeevi, "Nonparametric bandits with covariates," presented at the presented at the Int. Conf. Learn. Theory, Haifa, Israel, Jun. 2010.
12. M. Raginsky and A. Rakhlin, "Information complexity of black-box convex optimization: A new look via feedback information theory," in Proc. 47th Annu. Allerton Conf. Commun., Control, Comput., Monticello, IL, Oct. 2009, pp. 503-510.
13. G. Raskutti, M. Wainwright, and B. Yu, "Minimax rates of estimation for high-dimensional linear regression over-balls," IEEE Trans. Inf. Theory, vol. 57, no. 10, pp. 6976-6994, Oct. 2011.
14. S. Aeron, V. Saligrama, and M. Zhao, "Information theoretic bounds for compressed sensing," IEEE Trans. Inf. Theory, vol. 56, no. 10, pp. 5111-5130, Oct. 2010.
15. N. Verzelen, "Minimax risks for sparse regressions: Ultra-high-dimensional phenomenons," Electron. J. Statist., vol. 6, pp. 38-90, 2012.
16. E. Novak, "On the power of adaptation," J. Complexity, vol. 12, no. 3, pp. 199-237, 1996.
17. P. Indyk, E. Price, and D. Woodruff, "On the power of adaptivity in sparse recovery," in Proc. IEEE Symp. Found. Comp. Science, Palm Springs, CA, Oct. 2011, pp. 285-294.
18. J. Haupt, R. Castro, and R. Nowak, "Distilled sensing: Selective sampling for sparse signal recovery," presented at the presented at the Int. Conf. Art. Intell. Stat., Clearwater Beach, FL, Apr. 2009.
19. D. Donoho and J. Jin, "Higher criticism for detecting sparse heterogeneous mixtures," Ann. Statist., vol. 32, no. 3, pp. 962-994, 2004.
20. M. Malloy and R. Nowak, "On the limits of sequential testing in high dimensions," presented at the presented at the Asilomar Conf. Signals, Syst. Comput., Pacific Grove, CA, Nov. 2011.
21. D. Siegmund, "Tests and confidence intervals," in Sequential Analysis. New York: Springer-Verlag, 1985, Springer Series in Statistics.
22. J. Haupt, R. Nowak, and R. Castro, "Adaptive sensing for sparse signal recovery," presented at the presented at the Digit. Signal Process. Workshop, Marco Island, FL, Jan. 2009.
23. J. Haupt, R. Baraniuk, R. Castro, and R. Nowak, "Compressive distilled sensing: Sparse recovery using adaptivity in compressive measurements," in Proc. 43rd Asilomar Conf. Signals, Syst. Comput., Pacific Grove, CA, Nov. 2009, pp. 1551-1555.
24. R. Castro, J. Haupt, R. Nowak, and G. Raz, "Finding needles in noisy haystacks," in Proc. IEEE Int. Conf. Acoust., Speech, Signal Process., Las Vegas, NV, Apr. 2008, pp. 5133-5136.
25. S. Ji, Y. Xue, and L. Carin, "Bayesian compressive sensing," IEEE Trans. Signal Process., vol. 56, no. 6, pp. 2346-2356, Jun. 2008.
26. M. Iwen, "Group testing strategies for recovery of sparse signals in noise," in Proc. 43rd Asilomar Conf. Signals, Syst. Comput., Pacific Grove, CA, Nov. 2009, pp. 1561-1565.
27. P. Massart, Concentration Inequalities and Model Selection. Berlin, Germany: Springer-Verlag, 2007, vol. 1896, Lecture Notes in Mathematics.
28. E. Lehmann and J. Romano, Testing Statistical Hypotheses. New York: Springer-Verlag, 2005, Springer Texts in Statistics.
29. P. Assouad, "Deux remarques sur l'estimation," C. R. Acad. Sci. Paris Sér. I Math., vol. 296, no. 23, pp. 1021-1024, 1983.
30. M. A. Davenport and E. Arias-Castro, "Compressive binary search," in Proc. IEEE Int. Symp. Inf. Theory, Cambridge, MA, Jul. 2012, pp. 1827-1831.
31. M. Malloy and R. Nowak, "Near-optimal compressive binary search," 2012 [Online]. Available: arXiv:1203.1804