The paper studies estimation of univariate Gaussian mixture densities using the nonparametric maximum likelihood estimator (NPMLE). It proves that the unconstrained NPMLE attains the minimax optimal rate ∑(n)/n in squared Hellinger distance when the true mixing measure is sub‑Gaussian, and that a compactly constrained NPMLE achieves a slightly faster rate ∑(n)/(n∑∑(n)). The analysis relies on sharp bounds for local Hellinger bracketing entropy and introduces new bounds on the L² bracketing entropy of bounded‑degree polynomial balls.
arXiv:2610. 01088v1 Announce Type: cross Abstract: The nonparametric maximum likelihood estimator (NPMLE) of a Gaussian location mixture maximizes the likelihood over the infinite-dimensional space of mixing distributions.
arXiv:2606. 11469v1 Announce Type: cross Abstract: We study the task of density estimation, where we hope to accurately estimate a probability density from $n$ samples.
The paper develops a nonparametric empirical Bayes approach for estimating sums of functions of observable and unobservable variables in Poisson mixture models, using regular and coarsened minimum‑distance estimation of the mixing distribution. It proves large‑sample guarantees that the plug‑in estimates converge to the oracle Bayes estimate, achieving nearly parametric rates when the mixing distribution has finite support. Finite‑sample analyses are provided for two specific sums—total intensity below a threshold and the number of units exceeding latent intensity—along with minimax regret bounds and conditions for bounded regret.
arXiv:2504.05161v2 Announce Type: replace-cross Abstract: Score estimation is the backbone of score-based generative models (SGMs), especially denoising diffusion probabilistic models (DDPMs). A key...
arXiv:2606. 19876v1 Announce Type: new Abstract: The score matching problem is a central training objective in modern generative modeling, diffusion models, fitting unnormalized statistical models, and inverse problems.
arXiv:2506. 06584v2 Announce Type: replace Abstract: Learning Gaussian Mixture Models (GMMs) is a fundamental problem in statistics and machine learning, with the Expectation-Maximization (EM) algorithm and its popular variant gradient EM being arguably the most widely used algorithms in practice.
arXiv:2610. 07551v1 Announce Type: cross Abstract: Learning Gaussian mixture models (GMMs) using the Expectation-Maximization (EM) algorithm and its gradient-based variants is a fundamental problem in machine learning.
Learning Gaussian mixture models (GMMs) using the Expectation-Maximization (EM) algorithm and its gradient-based variants is a fundamental problem in machine learning. It is known that randomly initia...
arXiv:2404.12613v4 Announce Type: replace-cross Abstract: In this paper, we study the problem of learning one-dimensional Gaussian mixture models (GMMs) with a specific focus on estimating both the m...
arXiv:2609. 26647v1 Announce Type: cross Abstract: We study statistical rates in entropic optimal transport in the semi-discrete regime where one measure has finite support and the other is subGaussian.
arXiv:2609.16622v1 Announce Type: cross Abstract: Parameter estimation in finite mixture models can exhibit highly heterogeneous convergence behavior: locally isolated components may be estimated sub...
arXiv:2509. 22879v2 Announce Type: replace-cross Abstract: Mixture models, such as Gaussian mixture models, are widely used in machine learning to represent complex data distributions.