arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1812.02091cs.LGcs.IRstat.ML
收藏

低复杂度的数据并行地球移动器的距离近似

Low-Complexity Data-Parallel Earth Mover's Distance Approximations

IBM Research - Zurich(IBM苏黎世研究院)

Kubilay Atasu, Thomas Mittelholzer

摘要:

地球移动器距离(EMD)是用于比较离散概率分布的最先进的度量,但是其高可重复性以高计算复杂性为代价。即使线性复杂度的近似算法已被提出,以提高其可扩展性,这些算法要么是有限的向量空间,只有几个维度,或者它们变得无效时,概率分布之间的重叠程度高。我们提出了新的近似算法,克服了这两个限制,但仍然实现线性时间复杂度。我们所有的算法都是数据并行的,因此,我们利用了大规模并行计算引擎,如图形处理单元(GPU)。在流行的基于文本的20个新闻组数据集上,新算法比Word Mover的距离的多线程CPU实现快四个数量级,并匹配其最近邻居搜索精度。在MNIST图像上,新算法比Sinkhorn算法的GPU实现快四个数量级,同时提供略高的最近邻搜索精度。

英文摘要:

The Earth Mover's Distance (EMD) is a state-of-the art metric for comparing discrete probability distributions, but its high distinguishability comes at a high cost in computational complexity. Even though linear-complexity approximation algorithms have been proposed to improve its scalability, these algorithms are either limited to vector spaces with only a few dimensions or they become ineffective when the degree of overlap between the probability distributions is high. We propose novel approximation algorithms that overcome both of these limitations, yet still achieve linear time complexity. All our algorithms are data parallel, and thus, we take advantage of massively parallel computing engines, such as Graphics Processing Units (GPUs). On the popular text-based 20 Newsgroups dataset, the new algorithms are four orders of magnitude faster than a multi-threaded CPU implementation of Word Mover's Distance and match its nearest-neighbors-search accuracy. On MNIST images, the new algorithms are four orders of magnitude faster than a GPU implementation of the Sinkhorn's algorithm while offering a slightly higher nearest-neighbors-search accuracy.

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

↑