Robust $k$-means Clustering for Distributions with Two Moments
| Autor: | Nikita Zhivotovskiy, Yegor Klochkov, Alexey Kroshnin |
|---|---|
| Jazyk: | angličtina |
| Rok vydání: | 2020 |
| Předmět: |
Statistics and Probability
FOS: Computer and information sciences Computer Science - Machine Learning Strong consistency k-means clustering Estimator Mathematics - Statistics Theory Statistics Theory (math.ST) Upper and lower bounds Machine Learning (cs.LG) Distortion (mathematics) Bounded function Probability mass function FOS: Mathematics Applied mathematics Statistics Probability and Uncertainty Cluster analysis Mathematics |
| Popis: | We consider the robust algorithms for the $k$-means clustering problem where a quantizer is constructed based on $N$ independent observations. Our main results are median of means based non-asymptotic excess distortion bounds that hold under the two bounded moments assumption in a general separable Hilbert space. In particular, our results extend the renowned asymptotic result of Pollard, 1981 who showed that the existence of two moments is sufficient for strong consistency of an empirically optimal quantizer in $\mathbb{R}^d$. In a special case of clustering in $\mathbb{R}^d$, under two bounded moments, we prove matching (up to constant factors) non-asymptotic upper and lower bounds on the excess distortion, which depend on the probability mass of the lightest cluster of an optimal quantizer. Our bounds have the sub-Gaussian form, and the proofs are based on the versions of uniform bounds for robust mean estimators. 28 pages, to appear in Ann. of Statistics |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|