AI Paper Atlas

Research map / Learning theory and algorithms / Sample complexity

A Fourier Approach to Mixture Learning

Mingda Qiao, Guru Guruganesh, Ankit Singh Rawat, Kumar Avinava Dubey, Manzil Zaheer

NeurIPS 2022 · Learning theory and algorithms › Sample complexity · approach: Learning under log-concave distributions · 0 citations (OpenAlex)

Read the paperCheck your idea against 137,217 papers

AI-extracted. The measured effects below were read by AI from the paper's full text (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.

Measured effects reported in the paper

What was changedWhereMeasuredEffect
Fourier-based estimation at chosen frequencies gives poly(k)-time learning at separation d/sqrt(log k)Fourier mixture learner · spherical Gaussian mixtures, d = O(log k/log log k)required separationImproved
Lower bound: separation o(d/sqrt(log k))any learner · spherical Gaussian mixtures in low dimensionparameter identifiabilityHurt
Extend algorithm from Gaussians to translated copies of a distribution with slowly decaying Fourier transformFourier mixture learner · general location mixtureslearnabilityImproved
Compare to prior algorithms with arbitrarily small separationFourier mixture learner · spherical Gaussian mixturesruntime: e^{Omega(k)} -> O~(k^3)·f(d, Delta, epsilon)Improved

Closest papers by meaning

Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.

Open scime draft

Get the next scime Dispatch and a monthly field update

Free. We send a confirmation link first; every email has a one-click unsubscribe. Privacy