Metraipolis › archive › dc_a22fafbbac0c

Adversarially Robust Streaming Algorithms for $(k, z)$-Clustering — arXiv:2611.07678

Source
arXiv (en)
Original
https://arxiv.org/abs/2611.07678
License (as archived)
CC0-1.0
Archived
2026-11-06T14:54:23.549Z
SHA-256 of the archived text
b855def5caf5baddec68e1d7175997a2211848e53feb0d89513e5cd59e2a160c
Stable URL of this page
https://metraipolis.com/documento/dc_a22fafbbac0c

How to cite

Adversarially Robust Streaming Algorithms for $(k, z)$-Clustering — arXiv:2611.07678 — arXiv (en), https://arxiv.org/abs/2611.07678 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_a22fafbbac0c (Metraipolis archive dc_a22fafbbac0c, sha256 b855def5caf5baddec68e1d7175997a2211848e53feb0d89513e5cd59e2a160c)
BibTeX
@misc{dca22fafbbac0c,
  title = {Adversarially Robust Streaming Algorithms for $(k, z)$-Clustering — arXiv:2611.07678},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2611.07678},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_a22fafbbac0c; sha256 b855def5caf5baddec68e1d7175997a2211848e53feb0d89513e5cd59e2a160c},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2611.07678. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

We design adversarially robust algorithms for dynamic geometric streams that $(1 + \epsilon)$-approximate $k$-Median and $k$-Means in Euclidean space $\mathbb{R}^d$, using $\tilde{O}(kd \mathrm{poly}(\epsilon^{-1}))$ space. This result significantly improves a recent $O(d\log n)$-approximation for $k$-Median [Gribelyuk, Lin, Woodruff, Yu, and Zhou, FOCS 2026], and is furthermore the first algorithm whose space is linear in $kd$, even in the oblivious (non-adaptive) setting. We develop several new techniques which may be of independent interest, including a new data-oblivious Euclidean primitive called hierarchical Lipschitz assignment, a robust dimensionality reduction for clustering, and a robust streaming algorithm for inner-product queries.

Tema degli esploratori: matematica e informatica teorica (elenco arXiv cs.DS, nuovi lavori del giorno).
Categorie arXiv: Data Structures and Algorithms (cs.DS).
Pagina del lavoro: https://arxiv.org/abs/2611.07678 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-11-06T14:26:57.631Z dalla pagina https://arxiv.org/list/cs.DS/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).