基于Kd树的Wasserstein距离近似用于高维数据
Kd-tree Based Wasserstein Distance Approximation for High-Dimensional Data
AI总结:
本文提出kd-Flowtree,一种基于Kd树的Wasserstein距离近似方法,适用于高维数据检索,具有更高的精度和更快的计算速度。
摘要:
Wasserstein距离是概率分布之间的差异度量,由最优传输问题定义。它已被用于各种任务,如在高维图像或文本数据中检索相似项。然而,在检索应用中,Wasserstein距离需要反复计算,其与输入规模呈立方的计算复杂度使其不适合大规模数据集。最近,基于树的近似方法被提出以解决这一瓶颈。例如,Flowtree算法在四叉树上计算传输,并使用地面度量评估成本,而聚类树方法已被报告实现高精度。然而,现有树结构在预处理中往往需要显著的构造时间,并且关键的是,标准四叉树在高维空间中无法生长足够深,导致近似精度差。在本文中,我们提出了一种基于Kd树的Wasserstein距离近似方法kd-Flowtree,该方法利用Kd树进行数据嵌入。由于Kd树可以在高维情况下生长足够深并自适应,因此kd-Flowtree能够保持此类情况的良好近似精度。此外,Kd树比四叉树更快地构造,这有助于减少最近邻搜索所需的计算时间,包括预处理。我们提供了一个关于kd-Flowtree最近邻搜索精度的概率上限,并表明该上限与数据集大小无关。在数值实验中,我们证明了kd-Flowtree在使用真实数据的检索任务中优于现有的Wasserstein距离近似方法。
英文摘要:
The Wasserstein distance is a discrepancy measure between probability distributions, defined by an optimal transport problem. It has been used for various tasks such as retrieving similar items in high-dimensional images or text data. In retrieval applications, however, the Wasserstein distance is calculated repeatedly, and its cubic time complexity with respect to input size renders it unsuitable for large-scale datasets. Recently, tree-based approximation methods have been proposed to address this bottleneck. For example, the Flowtree algorithm computes transport on a quadtree and evaluates cost using the ground metric, and clustering-tree approaches have been reported to achieve high accuracy. However, these existing trees often incur significant construction time for preprocessing, and crucially, standard quadtrees cannot grow deep enough in high-dimensional spaces, resulting in poor approximation accuracy. In this paper, we propose kd-Flowtree, a kd-tree-based Wasserstein distance approximation method that uses a kd-tree for data embedding. Since kd-trees can grow sufficiently deep and adaptively even in high-dimensional cases, kd-Flowtree is capable of maintaining good approximation accuracy for such cases. In addition, kd-trees can be constructed quickly than quadtrees, which contributes to reducing the computation time required for nearest neighbor search, including preprocessing. We provide a probabilistic upper bound on the nearest-neighbor search accuracy of kd-Flowtree, and show that this bound is independent of the dataset size. In the numerical experiments, we demonstrated that kd-Flowtree outperformed the existing Wasserstein distance approximation methods for retrieval tasks with real-world data.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。