Skip to content
Preprint

Self-regularization and structural adaptation of NPMLE for Gaussian mixture models in all dimensions

Oct 2026 · 0 citations · 38 references
Mathematics

TL;DR

The proof applies a multivariate Jensen-type bound to control the typical number of critical points of the KKT function associated with the first-order optimality conditions, to lower bound its gradient norm uniformly on complex spheres.

Abstract

We establish structural properties of the nonparametric maximum likelihood estimator (NPMLE) for $d$-dimensional Gaussian mixtures whose means lie in a hypercube. We show that, with high probability, the NPMLE based on $n$ independent observations self-regularizes by fitting a mixture model with $O((\frac{\log n}{\log\log n})^d)$ components, achieving the optimal model complexity without explicit model selection. Furthermore, the NPMLE exhibits a structural adaptation property: For data drawn from a finite mixture, the number of fitted components is bounded in probability as $n\to\infty$. Our proof applies a multivariate Jensen-type bound to control the typical number of critical points of the KKT function associated with the first-order optimality conditions. The key step is to lower bound its gradient norm uniformly on complex spheres. We establish this lower bound by decomposing the KKT function into an empirical fluctuation term and a relative density estimation error term, combining small-ball probability estimates for the former with polynomial approximation and Hellinger error bounds for the latter.

View source

Similar papers

Preprint Oct 2026

Minimax Optimality of the NPMLE for Gaussian Mixtures in Hellinger Distance

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

Shayan Hundrieser, Tudor Manole · 1 citation
#machine learning Preprint Oct 2026

Polylogarithmic Sparsity of Randomly Reweighted NPMLEs for Gaussian Mixtures

The nonparametric maximum likelihood estimator of a Gaussian location mixture maximizes the likelihood over the infinite-dimensional space of mixing distributions using an effective-dimension principle for positive kernel mixtures: low-dimensional variation of the fitted values controls the support of every extreme poi...

Han-Sheng Jiang · 1 citation · ⚡1
Open access Oct 2026

Local minima of the empirical risk in high dimension: General theorems and convex examples

We consider a general model for high-dimensional empirical risk minimization whereby the data xi are d-dimensional Gaussian vectors, the model is parametrized by Θ∈Rd×k and the loss depends on the data via the projection ΘTxi. This setting covers as special cases classical statistics methods (e.g., multinomial regressi...

Kiana Asgari, Andrea Montanari, Basil Saeed · 0 citations
Preprint Sep 2026

Oracle high-dimensional $M$-estimation using smooth reparameterization for sparsity

This paper establishes a unified non-linear regularization framework for high-dimensional $M$-estimation, encompassing both linear regression and Cox's proportional hazards models. Rather than relying on traditional additive non-convex penalties, the proposed paradigm embeds sparsity directly into the parameter mapping...

Y. Nishiyama · 0 citations
Preprint Nov 2026

Optimal spectral shrinkage via Krylov approximation

Spectral shrinkage encompasses a broad family of estimators for high-dimensional linear regression that regularize estimation and prediction by applying spectral filters to the sample covariance matrix. Despite its widespread use, achieving oracle-optimal prediction risk under general covariance structures remains chal...

Tian-Feng Lu, Geoffrey J. Goodhill, Hong Hu · 0 citations
Preprint Sep 2026

Majorizing Measures for Canonical Processes with Log-Concave Tails

Let $Y_1,\ldots,Y_n$ be independent symmetric random variables with log-concave tails. We give a dimension-free characterization of the expected supremum of the canonical process $X_x=\sum_{i=1}^n x_iY_i$ without any $\Delta_2$ or regular-growth assumption on the coordinate tails. The characterization is governed by sc...

Xuan-Ang Hu, Han-Chao Wang, Xing-Long Wu · 3 citations · ⚡1

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.