arXiv Machine Learning September 1, 2026 By Xinyu Liu, Hai Zhang

Model Selection and Parameter Estimation for Multidimensional Gaussian Mixture Models with a Common Covariance Matrix

Read the original on arXiv Machine Learning →

The Flow has not summarised this story yet — read it at arXiv Machine Learning.

arXiv Machine Learning

Sep 1

Model Selection and Parameter Estimation of One-Dimensional Gaussian Mixture Models

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

By Xinyu Liu, Hai Zhang

arXiv Machine Learning

Oct 7

Is $\sqrt{d}$ Separation Necessary for Gradient EM to Learn Gaussian Mixtures in High Dimensions?

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.

By Yiran Zhang, Mo Zhou, Weihang Xu, Maryam Fazel, Simon S. Du

arXiv Statistics ML

6d ago

Diagonally-Weighted Generalized Method of Moments Estimation for Gaussian Mixture Modeling

arXiv:2507.20459v2 Announce Type: replace-cross Abstract: With direct computation of moments through order $L$ in $d$ dimensions, standard method of moments (MM) incurs $\Omega(d^L)$ computation and...

By Liu Zhang, Oscar Mickelin, Sheng Xu, Amit Singer

arXiv Machine Learning

Aug 11

Multi-kernel spectral clustering: Entrywise eigenvector perturbation bounds and exact recovery

arXiv:2608. 08704v1 Announce Type: cross Abstract: Kernel spectral clustering with a single bandwidth can be inadequate for data exhibiting multiple characteristic pairwise-distance scales, a problem particularly prevalent in the high-dimensional regime.

By Zeqin Lin, Guangming Pan, Zhixiang Zhang, Yinbing Zhou

rag

Hugging Face Trending Papers

Oct 6

Is $\sqrt{d}$ Separation Necessary for Gradient EM to Learn Gaussian Mixtures in High Dimensions?

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 Machine Learning

Jun 2

Dimension Reduction via Sum-of-Squares and Improved Clustering Algorithms for Non-Spherical Mixtures

arXiv:2411. 12438v2 Announce Type: replace-cross Abstract: We develop a new approach for clustering non-spherical (i.

By Prashanti Anderson, Mitali Bafna, Rares-Darius Buhai, Pravesh K. Kothari, David Steurer

benchmarks

One email a morning, machine-written

Related stories

Model Selection and Parameter Estimation of One-Dimensional Gaussian Mixture Models

Is $\sqrt{d}$ Separation Necessary for Gradient EM to Learn Gaussian Mixtures in High Dimensions?

Diagonally-Weighted Generalized Method of Moments Estimation for Gaussian Mixture Modeling

Multi-kernel spectral clustering: Entrywise eigenvector perturbation bounds and exact recovery

Is $\sqrt{d}$ Separation Necessary for Gradient EM to Learn Gaussian Mixtures in High Dimensions?

Dimension Reduction via Sum-of-Squares and Improved Clustering Algorithms for Non-Spherical Mixtures