Signals 4 · free daily AI digest

Minimax Optimality of the NPMLE for Gaussian Mixtures in Hellinger Distance

Paper recorded by Signals 4 on 2026-10-21 in cs.LG. Abstract reproduced from arXiv; link to the original below.

Published 2026-10-21 on arXiv · recorded by Signals 4 on 2026-10-22

Category: cs.LG · 机器学习 · first seen 2026-10-22

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 mi

Read on arXiv →

#208 most recent of 749 cs.LG papers we have recorded · ↑ newer: The role of locality and weight sharing in convolutional neural networ · ↓ older: Velocity Ambiguity Profiles: Time-Resolved Bayes-Risk Diagnostics for
Cite this page: Minimax Optimality of the NPMLE for Gaussian Mixtures in Hellinger Distance: the #208 most recent of 749 cs.LG papers we have recorded (as of 2026-10-21). Source: Signals 4 (Signals API) — https://data.jiangzhang.ca/signals4/t/papers/minimax-optimality-of-the-npmle-for-gaussian-mixtures-in-hellinger-distance.html
Free to quote with attribution to “Signals 4 (Signals API)”. Machine-readable: papers.json
Related: More cs.LG papers · arXiv signals · All papers · Today in AI
Get 4 AI signals a day by email — free.
Subscribe free → See all plans →
Get 4 AI signals a day by email — free
All models · All repos · By company · Daily editions