hiw3c 日报精选
arXiv cs.AI/CL/LG 网页快照

高斯混合体的NPMLE在Hellinger距离下的极小最大值问题

原文标题 · Minimax Optimality of the NPMLE for Gaussian Mixtures in Hellinger Distance

作者:Shayan Hundrieser, Tudor Manole | 我们研究了如何使用非参数最大似然估计方法来计算单变量高斯混合密度的问题。基于$n$个独立同分布的样本,我们发现无约束的NPMLE在平方Hellinger距离上能够达到最小最大最优速率$\log(n)/n$。此外,我们还证明了当真实混合测度是亚高斯分布时,这种估计方法仍然非常有效。

来源:arXiv cs.AI/CL/LG · arxiv.org

正文为英文,可一键机器翻译(仅首次需要等待)

Mathematics > Statistics Theory

Title: 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 $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.

Submission history

Access Paper:

Current browse context:

References & Citations

BibTeX formatted citation

Bookmark

Bibliographic and Citation Tools

Code, Data and Media Associated with this Article

Demos

Recommenders and Search Tools

arXivLabs: experimental projects with community collaborators

arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.

Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.

Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs .