paper-with-me

홈 › Papers

Optimal Clustering in Anisotropic Gaussian Mixture Models

2021-01-14 · Xin Chen, Anderson Y. Zhang

We study the clustering task under anisotropic Gaussian Mixture Models where the covariance matrices from different clusters are unknown and are not necessarily the identical matrix. We characterize the dependence of signal-to-noise ratios on the cluster centers and covariance matrices and obtain the minimax lower bound for the clustering problem. In addition, we propose a computationally feasible procedure and prove it achieves the optimal rate within a few iterations. The proposed procedure is a hard EM type algorithm, and it can also be seen as a variant of the Lloyd's algorithm that is adjusted to the anisotropic covariance matrices.

📄 PDF Abstract BibTeX arXiv:2101.05402

Code (0)

등록된 구현이 없습니다.

Tasks

Clustering

Similar Papers 제목 키워드 기반

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

2021-11-13 · Stanislav Minsker, Mohamed Ndaoud, Yiqiu Shen

We study the supervised clustering problem under the two-component anisotropic Gaussian mixture model in high dimensions and in the non-asymptotic setting. We first derive a lower and a matching upper bound for the minim…

Clustering

Minimax-Optimal Dimension-Reduced Clustering for High-Dimensional Nonspherical Mixtures

2025-02-04 · Chengzhu Huang, Yuqi Gu

In mixture models, nonspherical (anisotropic) noise within each cluster is widely present in real-world data. We study both the minimax rate and optimal statistical procedure for clustering under high-dimensional nonsphe…

ClusteringDimensionality Reduction

Universal Lower Bounds and Optimal Rates: Achieving Minimax Clustering Error in Sub-Exponential Mixture Models

2024-02-23 · Maximilien Dreveton, Alperen Gözeten, Matthias Grossglauser, Patrick Thiran

Clustering is a pivotal challenge in unsupervised machine learning and is often investigated through the lens of mixture models. The optimal error rate for recovering cluster labels in Gaussian and sub-Gaussian mixture m…

Clustering

Optimality of Spectral Clustering in the Gaussian Mixture Model

2019-11-01 · Matthias Löffler, Anderson Y. Zhang, Harrison H. Zhou

Spectral clustering is one of the most popular algorithms to group high dimensional data. It is easy to implement and computationally efficient. Despite its popularity and successful applications, its theoretical propert…

Clustering

EMAG: Differentiable 4D Gaussian Mixture Splatting for EEG Spatial Super-Resolution

2026-05-28 · Alex Lazarovich, Ofir Itzhak Shahar, Gur Elkin, Ohad Ben-Shahar arxiv

High-density electroencephalography (HD-EEG) enables fine-grained measurement of cortical activity but requires expensive hardware and lengthy setup times, limiting its clinical and research accessibility. We propose EMA…