Replicable Clustering
share
In this paper, we design replicable algorithms in the context of statistical clustering under the recently introduced notion of replicability. A clustering algorithm is replicable if, with high probability, it outputs the exact same clusters after two executions with datasets drawn from the same distribution when its internal randomness is shared across the executions. We propose such algorithms for the statistical k-medians, statistical k-means, and statistical k-centers problems by utilizing approximation routines for their combinatorial counterparts in a black-box manner. In particular, we demonstrate a replicable O(1)-approximation algorithm for statistical Euclidean k-medians (k-means) with poly(d) sample complexity. We also describe a O(1)-approximation algorithm with an additional O(1)-additive error for statistical Euclidean k-centers, albeit with exp(d) sample complexity.
READ FULL TEXT