On the Fundamental Limits of Adaptive Sensing
Authors:
- 28 August 2012
- journal article
- research article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 59 (1) , 472-481
Abstract
Suppose we can sequentially acquire arbitrary linear measurements of an n -dimensional vector x resulting in the linear model y = A x + z, where z represents measurement noise. If the signal is known to be sparse, one would expect the following folk theorem to be true: choosing an adaptive strategy which cleverly selects the next row of A based on what has been previously observed should do far better than a nonadaptive strategy which sets the rows of A ahead of time, thus not trying to learn anything about the signal in between observations. This paper shows that the folk theorem is false. We prove that the advantages offered by clever adaptive strategies and sophisticated estimation procedures-no matter how intractable-over classical compressed acquisition/recovery schemes are, in general, minimal.Keywords
All Related Versions
This publication has 24 references indexed in Scilit:
- How well can we estimate a sparse vector?Applied and Computational Harmonic Analysis, 2013
- Compressive binary search2012
- Minimax risks for sparse regressions: Ultra-high dimensional phenomenonsElectronic Journal of Statistics, 2012
- On the limits of sequential testing in high dimensions2011
- Minimax Rates of Estimation for High-Dimensional Linear Regression Over $\ell_q$-BallsIEEE Transactions on Information Theory, 2011
- Finding needles in noisy haystacksInternational Conference on Acoustics, Speech, and Signal Processing (ICASSP), 2008
- The Dantzig selector: Statistical estimation when p is much larger than nThe Annals of Statistics, 2007
- Higher criticism for detecting sparse heterogeneous mixturesThe Annals of Statistics, 2004
- Assouad, Fano, and Le Cam1997
- On the Power of AdaptionJournal of Complexity, 1996