The Average-Case Time Complexity of Certifying the Restricted Isometry Property

In compressed sensing, the restricted isometry property (RIP) on M × N sensing matrices (where M < N) guarantees efficient reconstruction of sparse vectors. A matrix has the (s,δ)-mathsfRIP property if behaves as a δ-approximate isometry on s-sparse vectors. It is well known that an M× N matrix with i.i.d. N(0,1/M) entries is (s,δ)-mathsfRIP with high probability as long as slesssim δ2 M/log N. On the other hand, most prior works aiming to deterministically construct (s,δ)-mathsfRIP matrices have failed when s gg √M. An alternative way to find an RIP matrix could be to draw a random gaussian matrix and certify that it is indeed RIP. However, there is evidence that this certification task is computationally hard when s gg √M, both in the worst case and the average case. In this paper, we investigate the exact average-case time complexity of certifying the RIP property for M× N matrices with i.i.d. N(0,1/M) entries, in the "possible but hard" regime √M ll slesssim M/log N. Based on analysis of the low-degree likelihood ratio, we give rigorous evidence that subexponential runtime NtildeOmega(s2/M) is required, demonstrating a smooth tradeoff between the maximum tolerated sparsity and the required computational power. This lower bound is essentially tight, matching the runtime of an existing algorithm due to Koiran and Zouzias. Our hardness result allows δ to take any constant value in (0,1), which captures the relevant regime for compressed sensing. This improves upon the existing average-case hardness result of Wang, Berthet, and Plan, which is limited to δ = o(1).