arXiv · 2611.19882
Certified Algorithms for Gaussian Location Mixture NPMLEs via Discretized Gradient Flows
Abstract
We study the computation of approximate nonparametric maximum likelihood estimators (NPMLEs) for Gaussian location mixtures in arbitrary dimension $d\ge 1$ via the Fisher-Rao gradient flow. We provide a certified algorithm based on an entropic proximal discretization of the flow which, given a sufficiently small $\varepsilon > 0$, returns an absolutely continuous mixing measure $\tildeμ$ admitting an exact finite-dimensional representation and satisfying $\hat L_n-L_n(f_{\tildeμ})\le\varepsilon$. For almost every dataset $X_1,\cdots, X_n \in \mathbb{R}^d$ satisfying $n>2(d+1)(m+1)^2$, where $m$ is the number of support points of the NPMLE, the algorithm requires $O(n\varepsilon^{-1}\log^{d+2}(1/\varepsilon))$ time. En route, we also establish results on the well-posedness and convergence properties of the continuous-time Fisher--Rao flow. In particular, initializing the flow at the uniform probability measure on a ball containing the convex hull of the observations, we show that $\hat L_n-L_n(f_{μ_t})=O(\log t/t)$. We also establish that, for almost every dataset satisfying the same condition on $n$ as above, the set of global maxima of the optimal score is the same as the support of the NPMLE, and the Hessian of the optimal score is nondegenerate at these points, extending a result of (Polyanskiy-Sellke, 2025) to higher dimensions.
Explore related subjects
Keep this discovery
Explore connections, maps & timelines
Pranav Gupta, Satyaki Mukherjee. 2026-11-15. Certified Algorithms for Gaussian Location Mixture NPMLEs via Discretized Gradient Flows. https://searcharxiv.com/abs/2611.19882
Citations retain the original authors and DOI and include this site’s record URL. If this discovery service contributed to your research, you can also cite Searcharxiv by Indiciae: BibTeX · RIS.