Robust Model Selection and Nearly-Proper Learning for GMMs

Understand

In learning theory, a standard assumption is that the data is generated from a finite mixture model.

• But what happens when the number of components is not known in advance? The problem of estimating the number of components, also called model selection, is important in its own right but there are essentially no known efficient algorithms with provable guarantees let alone ones that can tolerate adversarial corruptions.
• In this work, we study the problem of robust model selection for univariate Gaussian mixture models (GMMs).
• Given $\textsf{poly}(k/\epsilon)$ samples from a distribution that is $\epsilon$-close in TV distance to a GMM with $k$ components, we can construct a GMM with $\widetilde{O}(k)$ components that approximates the distribution to within $\widetilde{O}(\epsilon)$ in $\textsf{poly}(k/\epsilon)$ time.