Low-Degree Conjecture for hypothesis testing
Statement
Let and be distributions on , and let . Write for its projection onto the space of degree- polynomials. Strong detection means success probability , while weak detection means success probability for some constant . Low-Degree Conjecture. If for some , strong detection has no polynomial-time algorithm and requires runtime ; if for some , weak detection has no polynomial-time algorithm and requires runtime . The low-degree framework gives a common heuristic for computational lower bounds in problems such as sparse PCA, Planted Clique, and community detection, but the asserted connection to general polynomial-time algorithms remains conjectural.
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.