Papers
Topics
Authors
Recent
Search
2000 character limit reached

Derandomized compressed sensing with nonuniform guarantees for $\ell_1$ recovery

Published 27 Dec 2019 in cs.IT, math.CO, math.FA, and math.IT | (1912.12045v1)

Abstract: We extend the techniques of H\"{u}gel, Rauhut and Strohmer (Found. Comput. Math., 2014) to show that for every $\delta\in(0,1]$, there exists an explicit random $m\times N$ partial Fourier matrix $A$ with $m=s\operatorname{polylog}(N/\epsilon)$ and entropy $s\delta\operatorname{polylog}(N/\epsilon)$ such that for every $s$-sparse signal $x\in\mathbb{C}N$, there exists an event of probability at least $1-\epsilon$ over which $x$ is the unique minimizer of $|z|_1$ subject to $Az=Ax$. The bulk of our analysis uses tools from decoupling to estimate the extreme singular values of the submatrix of $A$ whose columns correspond to the support of $x$.

Citations (1)

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Authors (2)

Collections

Sign up for free to add this paper to one or more collections.