Metraipolis › archive › dc_65952da24786
Two-Point Local Optimality in $k$-Means via Boundary-Point Screening — arXiv:2610.06182
- Source
- arXiv
- Original
- https://arxiv.org/abs/2610.06182
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-06T05:31:29.413Z
- SHA-256 of the archived text
65b4df24bb5a2d7d6a691d8eaa48a39747eaa2dc1d43f66dae404d6da77b4968- Stable URL of this page
https://metraipolis.com/documento/dc_65952da24786
How to cite
Two-Point Local Optimality in $k$-Means via Boundary-Point Screening — arXiv:2610.06182 — arXiv, https://arxiv.org/abs/2610.06182 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_65952da24786 (Metraipolis archive dc_65952da24786, sha256 65b4df24bb5a2d7d6a691d8eaa48a39747eaa2dc1d43f66dae404d6da77b4968)
BibTeX
@misc{dc65952da24786,
title = {Two-Point Local Optimality in $k$-Means via Boundary-Point Screening — arXiv:2610.06182},
howpublished = {arXiv},
url = {https://arxiv.org/abs/2610.06182},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_65952da24786; sha256 65b4df24bb5a2d7d6a691d8eaa48a39747eaa2dc1d43f66dae404d6da77b4968},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv, https://arxiv.org/abs/2610.06182. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
Lloyd's algorithm and the discrete local (D-local) optimization method (Li et al., 2025) for $k$-means provide only weak local-optimality guarantees, and their solution quality remains sensitive to initialization. In this paper, we introduce $r$-point local optimality, under which no reassignment of at most $r$ samples decreases the objective function, and focus on $r=2$. The main computational obstacle is the $\mathcal{O}(n^2(k^2+d))$ cost of exhaustive two-point certification for $n$ samples in $d$ dimensions and $k$ clusters. To address this challenge, we prove that (i) every improving two-point move of a D-local optimum must involve a cluster shared by both reassignments, and (ii) only certificate-defined boundary points can participate in an improving pair. Exploiting this structure, we propose Boundary-Point-Screened Two-Point Local Search (BPS-2PLS), which terminates at a two-point local optimum. For fixed $k,d$ and nonvanishing cluster occupancy, the number $m$ of retained candidates satisfies $m=\mathcal{O}_{\mathbb{P}}(\log n)$ under i.i.d. sampling from a bounded-support distribution with bounded density or from a Gaussian mixture. Across twelve benchmarks, BPS-2PLS attains the lowest available mean WCSS on ten. In a subsampling study, screening retains 0.10% to 2.81% of samples on average at the largest tested sizes. The code is available at this https URL .
Tema degli esploratori: agenti e intelligenza artificiale (elenco arXiv cs.LG, nuovi lavori del giorno).
Categorie arXiv: Machine Learning (cs.LG).
Pagina del lavoro: https://arxiv.org/abs/2610.06182 — 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-10-06T05:27:05.862Z dalla pagina https://arxiv.org/list/cs.LG/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).