Sharp optimal recovery in the Two Component Gaussian Mixture Model

12/19/2018
by   Mohamed Ndaoud, et al.
0

In this paper, we study the problem of clustering in the Two component Gaussian mixture model when the centers are separated by some Δ>0. We present a non-asymptotic lower bound for the corresponding minimax Hamming risk improving on existing results. We also propose an optimal, efficient and adaptive procedure that is minimax rate optimal. The rate optimality is moreover sharp in the asymptotics when the sample size goes to infinity. Our procedure is based on a variant of Lloyd's iterations initialized by a spectral method. As a consequence of non-asymptotic results, we find a sharp phase transition for the problem of exact recovery in the Gaussian mixture model. We prove that the phase transition occurs around the critical threshold Δ̅ given by Δ̅^2 = σ^2(1 + √(1+2p/nn))n .

READ FULL TEXT
research
12/19/2018

Sharp optimal recovery in the Two Gaussian Mixture Model

In this paper, we study the non-asymptotic problem of exact recovery in ...
research
11/13/2021

Minimax Supervised Clustering in the Anisotropic Gaussian Mixture Model: A new take on Robust Interpolation

We study the supervised clustering problem under the two-component aniso...
research
07/21/2022

Bayesian Sparse Gaussian Mixture Model in High Dimensions

We establish the minimax risk for parameter estimation in sparse high-di...
research
06/29/2020

Sharp Statistical Guarantees for Adversarially Robust Gaussian Classification

Adversarial robustness has become a fundamental requirement in modern ma...
research
01/07/2021

SDP Achieves Exact Minimax Optimality in Phase Synchronization

We study the phase synchronization problem with noisy measurements Y=z^*...
research
11/04/2019

Iterative Algorithm for Discrete Structure Recovery

We propose a general modeling and algorithmic framework for discrete str...
research
02/15/2022

On the Role of Channel Capacity in Learning Gaussian Mixture Models

This paper studies the sample complexity of learning the k unknown cente...

Please sign up or login with your details

Forgot password? Click here to reset