Uniform-weight parallel-pancake Gaussian mixtures cannot be efficiently distinguished from a standard Gaussian by statistical query algorithms unless quasi-polynomial accuracy is allowed, and a testing algorithm with similar quasi-polynomial cost exists when most mixture weights are equal.
Statistical Algorithms and a Lower Bound for Detecting Planted Cliques
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.LG 1years
2025 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
On Learning Parallel Pancakes with Mostly Uniform Weights
Uniform-weight parallel-pancake Gaussian mixtures cannot be efficiently distinguished from a standard Gaussian by statistical query algorithms unless quasi-polynomial accuracy is allowed, and a testing algorithm with similar quasi-polynomial cost exists when most mixture weights are equal.