跳到正文
研踪PaperTrail
← 研踪 PaperTrail

arXiv:2611.17574 · v1

Fault Tolerant Coresets

首次提交 2026-11-13 06:53
版本更新 2026-11-13 06:53
雷达观测 2026-11-17 04:58
arXiv ↗PDF ↗

摘要

Coresets are small weighted summaries of large datasets that help quickly evaluate some loss objectives on the input dataset. We mainly focus on coresets for the kk-means objective, where the cost of the input dataset with respect to a set of kk centers is the sum of squared distances from each point to its closest center. A kk-means ε\varepsilon-coreset ΩΩ satisfies cost(P,S)=(1±ε)cost(Ω,S)\mathrm{cost}(P,S)=(1\pm\varepsilon)\mathrm{cost}(Ω,S) for every set SS of kk centers, where PP denotes the input dataset. A long line of work has established near optimal ε\varepsilon-coreset size bounds for kk-means. A key assumption in these works is that the coreset remains intact after construction. The question we ask is the following: if an adversary corrupts at most ff weighted entries of an ε\varepsilon-coreset, can we recover an O(ε)O(\varepsilon)-coreset via a decoding algorithm that is given only the corrupted coreset. This models situations where entries of the coreset can be corrupted during storage or transmission, and recovery must proceed without access to the original dataset. Our main result shows that increasing the usual coreset size by an additive O(fk/ε)O(fk/\varepsilon) yields a coreset that can be decoded into an O(ε)O(\varepsilon)-coreset after any ff adversarial corruptions. This bound is achieved by sensitivity sampling, a widely used method for constructing coresets. Our result is optimal in the sense that any fault tolerant coreset, whose decoding algorithm only keeps a subset of the points must also have size Ω(fk/ε)Ω(fk/\varepsilon). Our experiments demonstrate recovery under adversarial corruptions.

作者备注:32 pages, 21 figures. NeurIPS 2026

AI 论文解读

基于摘要 · 非全文审阅

此版本尚未生成 AI 解读。解读由后台任务生成并按论文版本保存,登录后共享已有结果。

版本差异

目前只收录了一个版本。收录下一版后,可以对照标题、作者、分类和摘要。

观测到的版本

相邻记录可能跳过中间版本;首次发现 v2 及以上也会标为版本更新。

v1 · 2026-11-13 06:53 · 最新观测版本

Fault Tolerant Coresets

Coresets are small weighted summaries of large datasets that help quickly evaluate some loss objectives on the input dataset. We mainly focus on coresets for the kk-means objective, where the cost of the input dataset with respect to a set of kk centers is the sum of squared distances from each point to its closest center. A kk-means ε\varepsilon-coreset ΩΩ satisfies cost(P,S)=(1±ε)cost(Ω,S)\mathrm{cost}(P,S)=(1\pm\varepsilon)\mathrm{cost}(Ω,S) for every set SS of kk centers, where PP denotes the input dataset. A long line of work has established near optimal ε\varepsilon-coreset size bounds for kk-means. A key assumption in these works is that the coreset remains intact after construction. The question we ask is the following: if an adversary corrupts at most ff weighted entries of an ε\varepsilon-coreset, can we recover an O(ε)O(\varepsilon)-coreset via a decoding algorithm that is given only the corrupted coreset. This models situations where entries of the coreset can be corrupted during storage or transmission, and recovery must proceed without access to the original dataset. Our main result shows that increasing the usual coreset size by an additive O(fk/ε)O(fk/\varepsilon) yields a coreset that can be decoded into an O(ε)O(\varepsilon)-coreset after any ff adversarial corruptions. This bound is achieved by sensitivity sampling, a widely used method for constructing coresets. Our result is optimal in the sense that any fault tolerant coreset, whose decoding algorithm only keeps a subset of the points must also have size Ω(fk/ε)Ω(fk/\varepsilon). Our experiments demonstrate recovery under adversarial corruptions.

查看此版本解读 →查看此版本原文 ↗