期刊
2019 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY (ISIT)
卷 -, 期 -, 页码 2709-2713出版社
IEEE
DOI: 10.1109/isit.2019.8849704
关键词
-
资金
- Ministry of Electronics and Information Technology
Data samples from R-d with common support of size kappa are accessed through m linear projections per sample. In the measurement-starved regime of m < kappa, how many samples are needed to recover the common support? We answer this question for a generative model with independent samples drawn from a subgaussian prior. We show that n = Theta((kappa(2)/m(2)) log(kappa(d - kappa))) samples are necessary and sufficient to exactly recover the support. Our proposed sample-optimal estimator has a closed-form expression and has computational complexity of O(dnm).
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据