arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2408.01325cs.DS
收藏

具有快速更新时间和小调整代价的完全动态k-聚类

Fully Dynamic $k$-Clustering with Fast Update Time and Small Recourse

Sayan Bhattacharya, Martín Costa, Naveen Garg, Silvio Lattanzi, Nikos Parotsidis

AI总结:

本文针对动态k-中位问题,提出随机局部搜索框架和拉格朗日松弛自适应方法,在近似比、调整代价与更新时间之间取得近似最优的权衡,显著推进了动态k-聚类领域核心开放问题的解决。

摘要:

在动态度量k-中位问题中,我们希望在输入度量空间$(V, d)$中维护一个包含$k$个中心点的集合$S \subseteq V$,该空间通过点的插入/删除进行更新,以最小化目标函数$\sum_{x \in V} \min_{y \in S} d(x, y)$。动态算法的质量通过其近似比、“调整代价”(每次更新中$S$的变化次数)和“更新时间”(处理一次更新所需的时间)来衡量。该研究方向的最终目标是获得一个动态$O(1)$近似算法,具有$\tilde{O}(1)$调整代价和$\tilde{O}(k)$更新时间。动态k-中位问题是被称为动态k-聚类的一类问题的典型例子,近年来受到了广泛关注。然而,据我们所知,以往的论文要么试图最小化算法的调整代价而忽略其更新时间,要么最小化算法的更新时间而忽略其调整代价。对于动态k-中位问题,我们通过以下结果任意接近地解决了该主题上的主要开放问题。(I)我们开发了一个新的随机局部搜索框架,适用于动态环境中的自适应。对于每个$ε> 0$,这为我们提供了一个动态k-中位算法,具有$O(1/ε)$近似比、$\tilde{O}(k^ε)$调整代价和$\tilde{O}(k^{1+ε})$更新时间。该框架还推广到具有$\ell^p$-范数目标的动态k-聚类,为动态k-均值提供了类似的界,并为动态k-中心提供了一个新的权衡。(II)如果只需要维护最优k-中位目标值的估计,那么我们获得了一个具有$\tilde{O}(k)$更新时间的$O(1)$近似算法。我们通过将拉格朗日松弛框架适配到动态环境中来实现这一结果。

英文摘要:

In the dynamic metric $k$-median problem, we wish to maintain a set of $k$ centers $S \subseteq V$ in an input metric space $(V, d)$ that gets updated via point insertions/deletions, so as to minimize the objective $\sum_{x \in V} \min_{y \in S} d(x, y)$. The quality of a dynamic algorithm is measured in terms of its approximation ratio, "recourse" (the number of changes in $S$ per update) and "update time" (the time it takes to handle an update). The ultimate goal in this line of research is to obtain a dynamic $O(1)$ approximation algorithm with $\tilde{O}(1)$ recourse and $\tilde{O}(k)$ update time. Dynamic $k$-median is a canonical example of a class of problems known as dynamic $k$-clustering, that has received significant attention in recent years. To the best of our knowledge, however, previous papers either attempt to minimize the algorithm's recourse while ignoring its update time, or minimize the algorithm's update time while ignoring its recourse. For dynamic $k$-median, we come arbitrarily close to resolving the main open question on this topic, with the following results. (I) We develop a new framework of randomized local search that is suitable for adaptation in a dynamic setting. For every $ε> 0$, this gives us a dynamic $k$-median algorithm with $O(1/ε)$ approximation ratio, $\tilde{O}(k^ε)$ recourse and $\tilde{O}(k^{1+ε})$ update time. This framework also generalizes to dynamic $k$-clustering with $\ell^p$-norm objectives, giving similar bounds for the dynamic $k$-means and a new trade-off for dynamic $k$-center. (II) If it suffices to maintain only an estimate of the value of the optimal $k$-median objective, then we obtain a $O(1)$ approximation algorithm with $\tilde{O}(k)$ update time. We achieve this result via adapting the Lagrangian Relaxation framework to the dynamic setting.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑