Minimax bounds for estimating multivariate Gaussian location mixtures
Arlene K. H. Kim, Adityanand Guntuboyina

TL;DR
This paper establishes the optimal rates for estimating multivariate Gaussian mixture models under different loss functions, revealing how tail behavior influences the minimax bounds in high-dimensional settings.
Contribution
It provides the first sharp minimax bounds for Gaussian location mixture estimation under squared $L^2$ and Hellinger losses, considering tail conditions of the mixing measure.
Findings
Minimax rate under squared $L^2$ loss is proportional to $n^{-1}( ext{log } n)^{d/2}$.
For sub-Gaussian tails, the Hellinger loss minimax rate is at least $( ext{log } n)^d / n$.
With bounded $p$-th moments, the rate is at least $n^{-p/(p+d)}( ext{log } n)^{-3d/2}$.
Abstract
We prove minimax bounds for estimating Gaussian location mixtures on under the squared and the squared Hellinger loss functions. Under the squared loss, we prove that the minimax rate is upper and lower bounded by a constant multiple of . Under the squared Hellinger loss, we consider two subclasses based on the behavior of the tails of the mixing measure. When the mixing measure has a sub-Gaussian tail, the minimax rate under the squared Hellinger loss is bounded from below by . On the other hand, when the mixing measure is only assumed to have a bounded moment for a fixed , the minimax rate under the squared Hellinger loss is bounded from below by . These rates are minimax optimal up to logarithmic factors.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsStatistical Methods and Inference
