In compressed sensing, for the ℓ² instance-optimal recovery estimate ‖x − Δ(Φx)‖₂ ≤ C₀σ_k(x)₂ with k ≤ c n log(N/n) and probability at least 1 − e^{−bn}, can one construct a…
Statement
In compressed sensing, for the ℓ² instance-optimal recovery estimate ‖x − Δ(Φx)‖₂ ≤ C₀σ_k(x)₂ with k ≤ c n log(N/n) and probability at least 1 − e^{−bn}, can one construct a decoder Δ with the same instance-optimality guarantee and low (fast) algorithmic complexity?
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 inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.