Nonparametric MLE for Gaussian Location Mixtures: Certified Computation and Generic Behavior

Abstract

We study the nonparametric maximum likelihood estimator π for Gaussian location mixtures in one dimension. It has been known since (Lindsay, 1983) that given an n-point dataset, this estimator always returns a mixture with at most n components, and more recently (Wu-Polyanskiy, 2020) gave a sharp O( n) bound for subgaussian data. In this work we study computational aspects of π. We provide an algorithm which for small enough >0 computes an -approximation of π in Wasserstein distance in time K+Cnk2(1/). Here K is data-dependent but independent of , while C is an absolute constant and k=|supp(π)|≤ n is the number of atoms in π. We also certifiably compute the exact value of |supp(π)| in finite time. These guarantees hold almost surely whenever the dataset (x1,…,xn)∈ [-cn1/4,cn1/4] consists of independent points from a probability distribution with a density (relative to Lebesgue measure). We also show the distribution of π conditioned to be k-atomic admits a density on the associated 2k-1 dimensional parameter space for all k≤ n/3, and almost sure locally linear convergence of the EM algorithm. One key tool is a classical Fourier analytic estimate for non-degenerate curves.

0

Turn this paper into a full lesson

ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…