Model assisted variable clustering: minimax-optimal recovery and algorithms

DOI10.1214/18-AOS1794zbMath1441.62164arXiv1508.01939OpenAlexW3008306357MaRDI QIDQ2176610

Christophe Giraud, Xi Luo, Nicolas Verzelen, Martin Royer, Florentina Bunea

Publication date: 5 May 2020

Published in: The Annals of Statistics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1508.01939

zbMATH Keywords

convergence ratesconvex optimizationhigh-dimensional inferencecovariance matrices

Mathematics Subject Classification ID

Classification and discrimination; cluster analysis (statistical aspects) (62H30) Nonparametric estimation (62G05) Minimax procedures in statistical decision theory (62C20)

Related Items

High-Dimensional Inference for Cluster-Based Graphical Models, Model assisted variable clustering: minimax-optimal recovery and algorithms, Efficient, certifiably optimal clustering with applications to latent variable graphical models, Posterior consistency of factor dimensionality in high-dimensional sparse factor models, Detecting approximate replicate components of a high-dimensional random vector with latent structure, A Doubly Enhanced EM Algorithm for Model-Based Tensor Clustering, Adaptive estimation in structured factor models with applications to overlapping clustering, Unnamed Item, Partial recovery bounds for clustering with the relaxed \(K\)-means

Uses Software

• k-means++

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Consistency thresholds for the planted bisection model
• Concentration inequalities and moment bounds for sample covariance operators
• Community detection in sparse networks via Grothendieck's inequality
• Model-based clustering of high-dimensional data: a review
• On semidefinite relaxations for the block model
• Model assisted variable clustering: minimax-optimal recovery and algorithms
• Entrywise eigenvector analysis of random matrices with low expected rank
• Adaptive estimation in structured factor models with applications to overlapping clustering
• Exact recovery in the Ising blockmodel
• Consistency of spectral clustering in stochastic block models
• Statistical-Computational Tradeoffs in Planted Problems and Submatrix Localization with a Growing Number of Clusters and Submatrices
• Clustering subgaussian mixtures by semidefinite programming
• Least squares quantization in PCM
• Approximating K‐means‐type Clustering via Semidefinite Programming
• Optimization via low-rank approximation for community detection in networks