Capacity-matrix probabilistic recovery bound

About 16 years old · traced to

Let Q\boldsymbol{Q} be the capacity matrix, let QV\boldsymbol{Q}^{V} be the vector of values Qi,jQ_{i,j} with i<ji<j in Ω\Omega, and let EQE_Q and σQ2\sigma_Q^2 denote its mean and variance, respectively:

σQ2=2L(L−1)∑i<j∈Ω(Qi,j−EQ)2.\sigma_Q^2=\frac{2}{L(L-1)}\sum_{i<j\in\Omega}(Q_{i,j}-E_Q)^2.

For an even integer llll and a support Γ\Gamma sampled uniformly at random from Ω\Omega, write P(ℓ)P(\ell) for the probability that Γ\Gamma admits ℓ1\ell_1-recovery. Capacity-matrix recovery conjecture. For any 1≤ℓ<1EQ1\leq \ell<\frac{1}{E_Q}, a support Γ\Gamma of even size ℓ\ell admits ℓ1\ell_1-recovery with probability

P(ℓ)>(12−ℓ2EQ)2ℓ2σQ2+(12−ℓ2EQ)2.P(\ell)>\frac{\left(\frac{1}{2}-\frac{\ell}{2}E_Q\right)^2}{\frac{\ell}{2}\sigma_Q^2+\left(\frac{1}{2}-\frac{\ell}{2}E_Q\right)^2}.

The claim is conjectural because it relies on a property used without proof; the paper indicates that further discussion appears in Appendix B. It provides a probabilistic recovery guarantee based on the mean and variance of the capacity-matrix entries.

References

Primary source

Joseph Shtok and Michael Elad, “Analysis of Basis Pursuit Via Capacity Sets”, arXiv:1004.4329 (2010).

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.