AI & ML
Minimax Optimality of the NPMLE for Gaussian Mixtures in Hellinger Distance
arXiv math.IT0 views
arXiv:2610.30109v1 Announce Type: cross Abstract: We analyze the problem of estimating univariate Gaussian mixture densities using the nonparametric maximum likelihood estimator (NPMLE) based on $n$ independent and identically distributed samples. We show that the unconstrained NPMLE achieves the minimax optimal rate $\log(n)/n$ in squared Hellinger distance, when the true mixing measure is sub-Gaussian. In addition, we show that when the true mixing measure has compact support, the NMPLE constrained to a compact interval also achieves the minimax optimal rate, which is slightly faster and of order $\log(n)/(n \log \log n)$. Our proof consists of sharply characterizing the local Hellinger bracketing entropy of the class of finite Gaussian mixtures. One of our key technical innovations is to sharply bound the $L^2$ bracketing entropy of balls of bounded-degree polynomials, which may be of independent interest. As an application, we establish the regret-optimality of $g$-modeling procedures based on the NPMLE in the Gaussian Empirical Bayes problem with bounded priors.
Source:https://arxiv.org/abs/2610.30109PreviousOn optimal (v,5,3,1) optical orthogonal codesNextOn Dependence Measures Based on $f$-Divergence and $\Phi$-Entropy
Related posts

Behavioral Design Unpacked: Nudges, Funnels & Persuasion | UX Unpacked #3
0dev.to UX
National Grid buys Teesside land for UK largest substation to power AI data center
0dev.to News

Leonardo AI Alternative in 2026
0dev.to Discuss

This is my first HacktoberFest, and I don't know what to feel.
0dev.to Discuss

12% of the Economy: The Benchmark That Grades AI Agents Like Employees
0dev.to Machine Learning
A headline said the CMB killed huge black holes. I read the two papers.
0dev.to Career