Robust \(k\)-means clustering for distributions with two moments

DOI10.1214/20-AOS2033zbMath1487.62070arXiv2002.02339OpenAlexW3204688258MaRDI QIDQ2054489

Yegor Klochkov, Alexey Kroshnin, Nikita Zhivotovskiy

Publication date: 3 December 2021

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

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

zbMATH Keywords

clusteringrobust estimation\(k\)-meansexcess distortion bounds

Mathematics Subject Classification ID

Asymptotic properties of parametric estimators (62F12) Classification and discrimination; cluster analysis (statistical aspects) (62H30) Robustness and adaptive procedures (parametric inference) (62F35)

Related Items (4)

Topics in robust statistical learning ⋮ Also for \(k\)-means: more data does not imply better performance ⋮ Robustifying Markowitz ⋮ Distribution-free robust linear regression

Cites Work

• Unnamed Item
• Unnamed Item
• Fast rates for empirical vector quantization
• Robust Bregman clustering
• Empirical risk minimization for heavy-tailed losses
• Quantization and clustering with Bregman divergences
• Strong consistency of k-means clustering
• The space complexity of approximating the frequency moments
• Sub-Gaussian estimators of the mean of a random vector
• On Hölder fields clustering
• Foundations of quantization for probability distributions
• Sub-Gaussian estimators of the mean of a random matrix with heavy-tailed entries
• Robust machine learning by median-of-means: theory and practice
• Robust covariance estimation under \(L_4\)-\(L_2\) norm equivalence
• Robust classification via MOM minimization
• Near-optimal mean estimators with respect to general norms
• Nonasymptotic bounds for vector quantization in Hilbert spaces
• Regularization, sparse recovery, and median-of-means tournaments
• Concentration Inequalities
• A Vector-Contraction Inequality for Rademacher Complexities
• Extensions of Lipschitz mappings into a Hilbert space
• Theory of Classification: a Survey of Some Recent Advances
• Improved Minimax Bounds on the Test and Training Distortion of Empirically Designed Vector Quantizers
• On the Performance of Clustering in Hilbert Spaces
• High-Dimensional Probability
• The minimax distortion redundancy in empirical quantizer design
• $K$-Dimensional Coding Schemes in Hilbert Spaces
• Upper and Lower Bounds for Stochastic Processes
• Testing the manifold hypothesis

This page was built for publication: Robust \(k\)-means clustering for distributions with two moments