ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let Pn\mathbb{P}_n and Qn\mathbb{Q}_n be probability distributions on Ωn\Omega_n, with likelihood ratio Ln=dPn/dQnL_n=d\mathbb{P}_n/d\mathbb{Q}_n. For a degree bound DD, let Ln≤DL_n^{\le D} denote the orthogonal projection of LnL_n onto the degree-DD polynomials under the L2(Qn)L^2(\mathbb{Q}_n) inner product.

Informal low-degree conjecture. For “nice” distributions Pn\mathbb{P}_n and Qn\mathbb{Q}_n, if

∥Ln≤D∥L2(Qn)=O(1)\|L_n^{\le D}\|_{L^2(\mathbb{Q}_n)}=O(1)

for some D=log⁡1+Ω(1)(n)D=\log^{1+\Omega(1)}(n), then there is no randomized polynomial-time algorithm for strong detection between P\mathbb{P} and Q\mathbb{Q}.

The conjecture formalizes the heuristic that bounded low-degree likelihood-ratio norm rules out efficient strong detection. It is explicitly informal because the paper does not define “nice” distributions; precise variants use coordinate degree. Evidence and applications are discussed for models including the stochastic block model and spiked tensor model, while the converse is not expected to hold.

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.