ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let N\P_N and \QN\Q_N be distributions on RN\mathbb{R}^N, and let χ2(N∥\QN):=E\x∼\QN[dN(\x)d\QN(\x)]2−1\chi^2(\P_N\|\Q_N):=\mathbb{E}_{\x\sim\Q_N}\left[\frac{d\P_N(\x)}{d\Q_N(\x)}\right]^2-1. Write χ≤D2(N∥\QN)\chi^2_{\leq D}(\P_N\|\Q_N) for its projection onto the space of degree-DD polynomials. Strong detection means success probability 1−o(1)1-o(1), while weak detection means success probability 12+ϵ\frac12+\epsilon for some constant ϵ>0\epsilon>0. Low-Degree Conjecture. If χ≤D2(N∥\QN)=O(1)\chi^2_{\leq D}(\P_N\|\Q_N)=O(1) for some D=ω(log⁡N)D=\omega(\log N), strong detection has no polynomial-time algorithm and requires runtime exp⁡(Ω~(D))\exp(\widetilde\Omega(D)); if χ≤D2(N∥\QN)=o(1)\chi^2_{\leq D}(\P_N\|\Q_N)=o(1) for some D=ω(log⁡N)D=\omega(\log N), weak detection has no polynomial-time algorithm and requires runtime exp⁡(Ω~(D))\exp(\widetilde\Omega(D)). 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 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.