ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Consider the single-spike model with dimension pp, sample size nn, spike support size kk, and signal strength β\beta. Let z\mathbf{z} denote the sparse spike, and let p/n→cp/n\to c. Polynomial-time support-recovery barrier conjecture. For fixed signal strength satisfying

β≤p/n,\beta\leq\sqrt{p/n},

and fixed ε>0\varepsilon>0, if

k=n0.5+ε,k=n^{0.5+\varepsilon},

then no polynomial-time algorithm can recover the support of z\mathbf{z} with probability tending to one as (n,p,k)→∞(n,p,k)\to\infty. This sharpens the preceding computational-barrier claim to support recovery in a specified asymptotic regime and is motivated by the failure of sophisticated SDP-based estimation methods.

Record

Comments

Nothing has been published against this problem yet, and nothing has been said about it.

Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.

Sign in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.