双Lipschitz扩展与离群点到树的嵌入
Bi-Lipschitz extensions and outlier embeddings into trees
AI总结:
提出一种高效算法,将任意度量空间中除k个离群点外的点嵌入到分层分离树(HST)中,失真度不超过(32+ε)c,离群点数量增加至O(k/ε log k)。
摘要:
我们发展了从任意度量空间到分层分离树(HST)的带离群点的低失真嵌入。特别地,我们提出一个高效算法,对于任意ε>0,给定输入度量空间(X,d),以及从X中除k个点外的所有点到HST的失真为c的概率嵌入,该算法从X中除O(k/ε log k)个点外的所有点到HST的概率嵌入中采样,实现失真至多为(32+ε)c。我们的结果基于两个关键技术组件。首先,我们将Munagala等人[2023]的将无离群点嵌入到HST中失真最小化的算法扩展到带离群点的情形。我们将此与关于树和ℓ1空间的双Lipschitz扩展的新结果相结合。特别地,我们证明任何到HST的概率嵌入可以扩展到额外的k个点,仅增加O(log k)倍的失真。这个双Lipschitz扩展结果利用了一种新的概率划分方案,我们称之为洋葱划分。
英文摘要:
We develop low distortion embeddings with outliers from arbitrary metrics into hierarchically separated trees (HSTs). In particular, we develop an efficient algorithm that for any $ε>0$, given an input metric $(X,d)$, and a probabilistic embedding of all but $k$ points from $X$ into HSTs with distortion $c$, samples from a probabilistic embedding of all but $O(\frac{k}ε\log k)$ points into HSTs that achieves distortion at most $(32+ε)c$. Our results are based on two key technical components. First, we extend an algorithm of Munagala et al. [2023] for minimizing the distortion of embeddings without outliers into HSTs to the setting with outliers. We combine this with new results on bi-Lipschitz extensions into trees and $\ell_1$ space. In particular, we show that any probabilistic embedding into HSTs can be extended to $k$ additional points with only a factor $O(\log k)$ of additional distortion. This bi-Lipschitz extension result utilizes a new probabilistic partitioning scheme that we call onion partitioning.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。