An unbiased approach to compressed sensing
In compressed sensing a sparse vector is approximately retrieved from an underdetermined equation system Ax = b. Exact retrievalwouldmean solving a large combinatorial problem which is well known to be NP-hard. For b of the form Ax0 + ϵ, where x0 is the ground truth and ϵ is noise, the 'oracle solution' is the one you get if you a priori know the support of x0, and is the best solution one could h