Moment-based Uniform Deviation Bounds for k-means and Friends
Not on the map. Why?
Abstract (arXiv)
Suppose k centers are fit to m points by heuristically minimizing the k-means cost; what is the corresponding fit over the source distribution? This question is resolved here for distributions with p≥ 4 bounded moments; in particular, the difference between the sample cost and distribution cost decays with m and p as m^min-1/4, -1/2+2/p. The essential technical contribution is a mechanism to uniformly control deviations in the face of unbounded parameter sets, cost functions, and source distributions. To further demonstrate this mechanism, a soft clustering variant of k-means cost is also considered, namely the log likelihood of a Gaussian mixture, subject to the constraint that all covariance matrices have bounded spectrum. Lastly, a rate with refined constants is provided for k-means instances possessing some cluster structure.
Key facts. Cited by 11 papers in the map (data through 7 Oct 2026). First posted on arXiv 8 Nov 2013.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2021: 2; 2022: 3; 2023: 1; 2024: 1; 2025: 3; 2026: 1.
11 papers.
- 2022Stochastic linear optimization never overfits with quadratically-bounded losses on general datacited by 16
- 2021Uniform Concentration Bounds toward a Unified Framework for Robust Clusteringcited by 10
- 2025Uniform Mean Estimation for Heavy-Tailed Distributions via Median-of-Meanscited by 4
- 2022Bregman Power k-Means for Clustering Exponential Family Datacited by 3
- 2023Consistency of Lloyd's Algorithm Under Perturbationscited by 2
- 2022Coresets for Relational Data and The Applicationscited by 1
- 2024On uniqueness of the set of k-meanscited by 1
- 2021Distribution free optimality intervals for clusteringcited by 0
- 2025Information-theoretic Generalization Analysis for VQ-VAEs: A Role of Latent Variablescited by 0
- 2025Task-Driven Discrete Representation Learningcited by 0
- 2026The Condition-Number Principle for Prototype Clusteringcited by 0
- 2026The Condition-Number Principle for Prototype Clustering9 Apr 2026
- 2025Uniform Mean Estimation for Heavy-Tailed Distributions via Median-of-Means17 Jun 2025
- 2025Task-Driven Discrete Representation Learning13 Jun 2025
- 2025Information-theoretic Generalization Analysis for VQ-VAEs: A Role of Latent Variables26 May 2025
- 2024On uniqueness of the set of k-means17 Oct 2024
- 2023Consistency of Lloyd's Algorithm Under Perturbations1 Sep 2023
- 2022Coresets for Relational Data and The Applications9 Oct 2022
- 2022Bregman Power k-Means for Clustering Exponential Family Data22 Jun 2022
- 2022Stochastic linear optimization never overfits with quadratically-bounded losses on general data14 Feb 2022
- 2021Uniform Concentration Bounds toward a Unified Framework for Robust Clustering27 Oct 2021
- 2021Distribution free optimality intervals for clustering30 Jul 2021