Improved Algorithms for Adaptive Compressed Sensing
Vasileios Nakos, Xiaofei Shi, David P. Woodruff, Hongyang Zhang

TL;DR
This paper advances adaptive compressed sensing algorithms, reducing measurement complexity and rounds for estimating sparse vectors, and extends improvements across various p-norm settings.
Contribution
It improves measurement bounds and adaptivity rounds for adaptive compressed sensing, and generalizes these improvements to all p, q norms with new bounds.
Findings
Reduced measurements to O(k log log(n/k)) for certain settings.
Achieved optimal O(log log n) rounds in adaptive schemes.
Extended improvements to all (p,p) norm cases for 0<p<2.
Abstract
In the problem of adaptive compressed sensing, one wants to estimate an approximately -sparse vector from linear measurements , where can be chosen based on the outcomes of previous measurements. The goal is to output a vector for which with probability at least , where is an approximation factor. Indyk, Price and Woodruff (FOCS'11) gave an algorithm for for with measurements and rounds of adaptivity. We first improve their bounds, obtaining a scheme with measurements and rounds, as well as a scheme with $\Oh((k/\epsilon)…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsSparse and Compressive Sensing Techniques · Microwave Imaging and Scattering Analysis · Electrical and Bioimpedance Tomography
