ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let nn, dd, and KK be positive integers with d≥Kd\geq K, and let Δ∗\Delta_* denote the separation parameter for the Gaussian-mixture clustering model. Write a≳log⁡ba\gtrsim_{\log} b when aa is at least bb up to polylogarithmic factors. Polynomial-time clustering conjecture. For any nn, dd, and KK such that d≥Kd\geq K, it is possible to reconstruct the partition in polynomial time as long as

Δ∗2≳log⁡[1+(dK2n+Kn1/4)∧d].\Delta_*^2 \gtrsim_{\log} \left[1 + \left( \sqrt{\frac{dK^2}{n}}+ \frac{K}{n^{1/4}} \right) \wedge \sqrt{d} \right].

Together with the paper's low-degree lower bound and the lower bounds of Even (2025), this would identify the computational threshold up to polylogarithmic factors for the stated range of dimensions. The paper proves a matching upper bound only for specific instances, so the general assertion remains 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.