ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let t:N→Nt: \mathbb{N} \to \mathbb{N}. Consider a “natural” high-dimensional testing problem specified by distributions PN\mathbb{P}_N and QN\mathbb{Q}_N on an observation space ΩN\Omega_N, and let LNL_N denote the corresponding likelihood ratio, with ∥LN≤D(N)∥\|L_N^{\leq D(N)}\| its degree-D(N)D(N) low-degree norm. Low-degree conjecture. If ∥LN≤D(N)∥\|L_N^{\leq D(N)}\| remains bounded as N→∞N \to \infty whenever D(N)≤t(N) polylog⁡(N)D(N) \leq t(N)\,\operatorname{polylog}(N), then there is no sequence of functions fN:ΩN→{p,q}f_N: \Omega_N \to \{\textit{p},\textit{q}\}, computable in time NO(t(N))N^{O(t(N))}, that strongly distinguishes PN\mathbb{P}_N and QN\mathbb{Q}_N; that is, no such sequence satisfies

lim⁡N→∞QN[fN(Y)=q]=lim⁡N→∞PN[fN(Y)=p]=1.\lim_{N \to \infty} \mathbb{Q}_N\left[f_N(Y)=\textit{q}\right]=\lim_{N \to \infty} \mathbb{P}_N\left[f_N(Y)=\textit{p}\right]=1.

The conjecture formalizes the observed connection between bounded low-degree likelihood-ratio norms and computational hardness, asserting that degree-DD polynomial methods capture the power of algorithms with runtime about NO(D/polylog⁡(N))N^{O(D/\operatorname{polylog}(N))}. It is explicitly presented as an informal conjecture for natural problems, so the scope of “natural” testing problems and the precise generality of the claim remain open.

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.