A poly(d,k)-time algorithm learns mixtures of k heavy-tailed spherical distributions via high-dimensional sparse Fourier transforms without needing mean separation.
goodβ if there is a permutationπsuch that max πβ[π]β₯ππβbπ(β) π(π)β₯2β€πβ² and max πβ[π]|π€πβbπ€ π(π)|β€ππ€ , and we will call it βbad
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.DS 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Learning Mixture Models via Efficient High-dimensional Sparse Fourier Transforms
A poly(d,k)-time algorithm learns mixtures of k heavy-tailed spherical distributions via high-dimensional sparse Fourier transforms without needing mean separation.