Skip to content
DraconiticResearch
Search Sources API
203,948 studies31 sourcesUpdated 22 min ago
PreprintarXiv licencearXiv

Minimax Optimality of the NPMLE for Gaussian Mixtures in Hellinger Distance

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 L2 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.

Related

  1. Robust Local Fréchet Regression: Nonasymptotic Theory and Minimax Optimality
    Chang Jun Im, Daisuke Kurisu
    arXivPreprintarXiv licenceFull textStatisticsarXiv
  2. Minimax-Optimality of Posterior Sampling for Reinforcement Learning
    Taewon Goo, Kihyuk Hong
    arXivPreprintarXiv licenceFull textStatisticsarXiv
  3. On Minimax Optimality and Uniqueness of Fixed-Step First-Order Methods for Smooth Convex Optimization
    Benjamin Grimmer, Sunghyeon Jo, Chanwoo Park
    arXivPreprintCC BY 4.0Full textOptimisation & controlarXiv
  4. Online Individualized Treatment Selection under Partial Feedback: False Discovery Control and Minimax Optimality
    Runzhe Gu, Zinan Zhao, Wenguang Sun +1
    arXivPreprintCC BY 4.0Full textStatisticsarXiv
  5. Minimax Optimality of Shampoo for Nonstationary Stochastic Optimization
    Abir Sarkar, Nirmalya Mandal, Martin T. Wells
    arXivPreprintarXiv licenceFull textStatisticsarXiv
BibTeX
@misc{hundrieser2026minimax,
  title = {{Minimax Optimality of the NPMLE for Gaussian Mixtures in Hellinger Distance}},
  author = {Shayan Hundrieser and Tudor Manole},
  howpublished = {arXiv},
  year = {2026},
  month = oct,
  doi = {10.48550/arxiv.2610.30109},
  eprint = {2610.30109},
  archivePrefix = {arXiv},
  url = {https://arxiv.org/abs/2610.30109},
}
RIS
TY  - UNPB
TI  - Minimax Optimality of the NPMLE for Gaussian Mixtures in Hellinger Distance
AU  - Shayan Hundrieser
AU  - Tudor Manole
PY  - 2026
DA  - 2026/10/21
PB  - arXiv
DO  - 10.48550/arxiv.2610.30109
UR  - https://arxiv.org/abs/2610.30109
AB  - 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.
ER  -