The optimal sampling bound conjecture for random subsets and RIP

About 15 years old · traced to

Let nn and ss be positive integers, and let Ω⊂{0,1,…,n−1}\Omega\subset\{0,1,\ldots,n-1\} be a random subset whose average cardinality is kk. The subset satisfies the restricted isometry property (RIP) if the associated Fourier measurement system preserves the Euclidean norm of every ss-sparse signal up to a fixed multiplicative distortion.

Optimal sampling bound conjecture. A random subset Ω⊂{0,1,…,n−1}\Omega\subset\{0,1,\ldots,n-1\} of average cardinality

k=O(slog⁡n)k=O(s\log n)

satisfies RIP with high probability.

This conjecture concerns the optimal order of the number of Fourier measurements needed for uniform recovery of sparse signals. The source contrasts it with the weaker bound proved earlier in the paper and with stronger results of Rudelson, Vershynin, and Rauhut; the conjectured O(slog⁡n)O(s\log n) sampling rate remains the target bound in this discussion.

References

Primary source

Marius Junge and Qiang Zeng, “Noncommutative Bennett and Rosenthal inequalities”, arXiv:1111.1027 (2013).

Progress summary

Never refreshed

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Solutions 0

No solutions have been posted yet.