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

基于GPU的Vietoris-Rips持久条形码计算

GPU-Accelerated Computation of Vietoris-Rips Persistence Barcodes

The Ohio State University(俄亥俄州立大学)

Simon Zhang, Mengbai Xiao, Hao Wang

AI总结:

本文提出基于GPU的Vietoris-Rips持久条形码计算方法,利用并行算法和数学性质,实现高效计算,提升速度并降低内存使用。

摘要:

Vietoris-Rips持久条形码的计算过程既耗费执行资源又占用大量内存。本文研究其计算结构,识别出与GPU相关的数学性质和算法机会。我们探讨了独立可识别的持久对(apparent pairs)的性质,证明了其上下界和概率下界。我们设计了大规模并行算法,利用可独立处理的大量简单形体。开发了名为Ripser++的GPU加速软件,证明在良好采样条件下,算法的工作复杂度接近线性,深度复杂度仅依赖于p维同调循环的期望数量。软件在总执行时间上比原始Ripser快30倍,并降低了CPU内存使用2.0倍。我们相信基于GPU的加速努力为拓扑数据分析在摩尔定律之后的发展开辟了新纪元。

英文摘要:

The computation of Vietoris-Rips persistence barcodes is both execution-intensive and memory-intensive. In this paper, we study its computational structure and identify several unique mathematical properties and algorithmic opportunities with connections to the GPU. Mathematically and empirically, we look into the properties of apparent pairs, which are independently identifiable persistence pairs comprising up to 99\% of persistence pairs. We prove tight upper and lower bounds of the apparent pair rate and some probabilistic lower bounds. We also design massively parallel algorithms to take advantage of the very large number of simplices that can be processed independently of each other. Having identified these opportunities, we develop a GPU-accelerated software for computing Vietoris-Rips persistence barcodes, called Ripser++. Under nice sampling conditions, we show that the expected work complexity of our algorithm is near linear in the number of simplices. The expected depth complexity is dependent only on the computation of the expected number of $p$-dimensional homological cycles. The software achieves up to 30x speedup over the total execution time of the original Ripser and also reduces CPU-memory usage by up to 2.0x. We believe our GPU-acceleration based efforts open a new chapter for the advancement of topological data analysis in the post-Moore's Law era.

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

↑