Sample-Measurement Tradeoff in Support Recovery Under a Subgaussian Prior

被引:1
作者
Ramesh, Lekshmi [1 ]
Murthy, Chandra R. [1 ]
Tyagi, Himanshu [1 ]
机构
[1] Indian Inst Sci, Dept Elect Commun Engn, Bengaluru 560012, India
关键词
Support recovery; compressed sensing; joint sparsity; sample complexity; SIMULTANEOUS SPARSE APPROXIMATION; AVERAGE-CASE ANALYSIS; ALGORITHMS; BOUNDS; LIMITS;
D O I
10.1109/TIT.2021.3111992
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Data samples from R-d with a common support of size k are accessed through m random linear projections (measurements) per sample. It is well-known that roughly k measurements from a single sample are sufficient to recover the support. In the multiple sample setting, do k overall measurements still suffice when only m measurements per sample are allowed, with m < k? We answer this question in the negative by considering a generative model setting with independent samples drawn from a subgaussian prior. We show that n = Theta((k(2)/m(2)) . log k(d-k)) samples are necessary and sufficient to recover the support exactly. In turn, this shows that when m < k, k overall measurements are insufficient for support recovery; instead we need about m measurements each from k(2)/m(2) samples, and therefore k(2)/m overall measurements are necessary.
引用
收藏
页码:8140 / 8153
页数:14
相关论文
共 31 条
[1]   Inference Under Information Constraints I: Lower Bounds From Chi-Square Contraction [J].
Acharya, Jayadev ;
Canonne, Clement L. ;
Tyagi, Himanshu .
IEEE TRANSACTIONS ON INFORMATION THEORY, 2020, 66 (12) :7835-7855
[2]   Information Theoretic Bounds for Compressed Sensing [J].
Aeron, Shuchin ;
Saligrama, Venkatesh ;
Zhao, Manqi .
IEEE TRANSACTIONS ON INFORMATION THEORY, 2010, 56 (10) :5111-5130
[3]   Extreme Compressive Sampling for Covariance Estimation [J].
Azizyan, Martin ;
Krishnamurthy, Akshay ;
Singh, Aarti .
IEEE TRANSACTIONS ON INFORMATION THEORY, 2018, 64 (12) :7613-7635
[4]   Localization of more sources than sensors via jointly-sparse bayesian learning [J].
Balkan, Ozgur ;
Kreutz-Delgado, Kenneth ;
Makeig, Scott .
IEEE Signal Processing Letters, 2014, 21 (02) :131-134
[5]   ROP: MATRIX RECOVERY VIA RANK-ONE PROJECTIONS [J].
Cai, T. Tony ;
Zhang, Anru .
ANNALS OF STATISTICS, 2015, 43 (01) :102-138
[6]   Exact and Stable Covariance Estimation From Quadratic Sampling via Convex Programming [J].
Chen, Yuxin ;
Chi, Yuejie ;
Goldsmith, Andrea J. .
IEEE TRANSACTIONS ON INFORMATION THEORY, 2015, 61 (07) :4034-4059
[7]   Condition numbers of gaussian random matrices [J].
Chen, ZZ ;
Dongarra, JJ .
SIAM JOURNAL ON MATRIX ANALYSIS AND APPLICATIONS, 2005, 27 (03) :603-620
[8]  
Csiszar I., 2004, Foundations and Trends in Communications and Information Theory, V1, P1, DOI 10.1561/0100000004
[9]   Average Case Analysis of Multichannel Sparse Recovery Using Convex Relaxation [J].
Eldar, Yonina C. ;
Rauhut, Holger .
IEEE TRANSACTIONS ON INFORMATION THEORY, 2010, 56 (01) :505-519
[10]   Necessary and Sufficient Conditions for Sparsity Pattern Recovery [J].
Fletcher, Alyson K. ;
Rangan, Sundeep ;
Goyal, Vivek K. .
IEEE TRANSACTIONS ON INFORMATION THEORY, 2009, 55 (12) :5758-5772