arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2110.14734cs.CG
收藏

通过图稀疏化近似持久图之间的1-Wasserstein距离

Approximating 1-Wasserstein Distance between Persistence Diagrams by Graph Sparsification

Tamal K. Dey, Simon Zhang

AI总结:

本文针对大规模持久图间1-Wasserstein距离计算困难的问题,提出通过点压缩、良分离对分解图稀疏化及并行化实现近线性时间的完全多项式时间近似方案,并开发了开源软件PDoptFlow,实验证明其误差低且性能优于现有方法。

摘要:

持久图(PD)在拓扑数据分析中扮演着核心角色。此类分析需要计算这些图之间的距离,例如1-Wasserstein距离。对于产生大型图的大数据集,使用现有方法精确计算这些PD距离可能无法适当扩展。主要困难源于需要在其上计算匹配以确定这些PD距离的二部图的规模。我们通过提出若干算法和计算方面的观察来解决这一问题,从而在理论上获得一个近线性的完全多项式时间近似方案。在常数维度下,假设(1+ε)近似EMD猜想成立,即平面上的EMD问题无法在$O(\ rac{1}{ε^2}n)$时间内(最多相差多重对数因子)由PTAS近似,则该方案在理论上是渐近最优的。在我们的实现中,首先利用PD点的分布,我们对它们进行压缩,从而减少用于计算的图中节点的数量。点重数的增加通过将匹配问题归约为转运网络上的最小费用流问题来解决。其次,我们使用良分离对分解将图稀疏化到与点数成线性关系的规模。节点和弧的稀疏化都对近似因子有贡献,其中我们利用了由松弛词移动距离给出的下界。第三,我们通过引入并行性消除了稀疏化过程中的瓶颈。第四,我们基于我们的算法开发了一个名为PDoptFlow的开源软件,利用GPU和多核实现并行。我们进行了大量实验,并表明实际经验误差非常低。我们还表明,我们可以在低保证相对误差下实现高性能,超越了现有技术水平。

英文摘要:

Persistence diagrams (PD)s play a central role in topological data analysis. This analysis requires computing distances among such diagrams such as the $1$-Wasserstein distance. Accurate computation of these PD distances for large data sets that render large diagrams may not scale appropriately with the existing methods. The main source of difficulty ensues from the size of the bipartite graph on which a matching needs to be computed for determining these PD distances. We address this problem by making several algorithmic and computational observations in order to obtain, in theory, a near-linear fully polynomial-time approximation scheme. This is theoretically optimal assuming the $(1+ε)$-approximate EMD conjecture in constant dimension, which is that the EMD problem on the plane cannot be approximated by a PTAS in time $O(\frac{1}{ε^2}n)$ up to polylog factors. In our implementation, first, taking advantage of the distribution of PD points, we \emph{condense} them thereby decreasing the number of nodes in the graph for computation. The increase in point multiplicities is addressed by reducing the matching problem to a min-cost flow problem on a transshipment network. Second, we use Well Separated Pair Decomposition to sparsify the graph to a size that is linear in the number of points. Both node and arc sparsifications contribute to the approximation factor where we leverage a lower bound given by the Relaxed Word Mover's distance. Third, we eliminate bottlenecks during the sparsification procedure by introducing parallelism. Fourth, we develop an open source software called PDoptFlow based on our algorithm, exploiting parallelism by GPU and multicore. We perform extensive experiments and show that the actual empirical error is very low. We also show that we can achieve high performance at low guaranteed relative errors, improving upon the state of the arts.

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

↑