随机切割对于可解释k-中位数问题是最优的
Random Cuts are Optimal for Explainable k-Medians
AI总结:
本文证明 RandomCoordinateCut 算法在 l1 范数下对可解释 k-中位数问题具有最优竞争比,其上界 2ln k + 2 与已知下界 Omega(log k) 相匹配。
摘要:
我们证明 RandomCoordinateCut 算法在 l1 范数下为可解释 k-中位数问题提供了最优竞争比。可解释 k-中位数问题由 Dasgupta、Frost、Moshkovitz 和 Rashtchian 于 2020 年提出。若干作者团队独立提出了一个简单的多项式时间随机算法,并证明该算法具有 O(log k loglog k) 的竞争比。我们对该算法进行了紧致分析,证明其竞争比上界为 2ln k + 2。这一上界与 Dasgupta 等人(2020)给出的 Omega(log k) 下界相匹配。
英文摘要:
We show that the RandomCoordinateCut algorithm gives the optimal competitive ratio for explainable k-medians in l1. The problem of explainable k-medians was introduced by Dasgupta, Frost, Moshkovitz, and Rashtchian in 2020. Several groups of authors independently proposed a simple polynomial-time randomized algorithm for the problem and showed that this algorithm is O(log k loglog k) competitive. We provide a tight analysis of the algorithm and prove that its competitive ratio is upper bounded by 2ln k +2. This bound matches the Omega(log k) lower bound by Dasgupta et al (2020).
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。