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

PLLay:基于持久化景观的高效拓扑层

PLLay: Efficient Topological Layer based on Persistence Landscapes

Carnegie Mellon University(卡内基梅隆大学);Inria(法国国家信息与自动化研究所);Google Research(谷歌研究院)

Kwangho Kim, Jisu Kim, Manzil Zaheer, Joon Sik Kim, Frederic Chazal, Larry Wasserman

摘要:

我们提出了PLLay,这是一种基于持久性景观的通用深度学习模型的新型拓扑层,可以有效地利用输入数据结构的底层拓扑特征。在这项工作中,我们证明了可微性相对于层的输入,一般持久的同源任意过滤。因此,我们提出的层可以放置在网络中的任何地方,并将输入数据的拓扑特征的关键信息馈送到后续层中,以提高网络对给定任务的可学习性。PLLay的任务优化结构在训练过程中通过反向传播学习,而不需要任何输入特征化或数据预处理。我们提供了一种新的适应DTM功能为基础的过滤,并表明,所提出的层是强大的噪声和离群值,通过稳定性分析。我们证明了我们的方法的有效性,在各种数据集上的分类实验。

英文摘要:

We propose PLLay, a novel topological layer for general deep learning models based on persistence landscapes, in which we can efficiently exploit the underlying topological features of the input data structure. In this work, we show differentiability with respect to layer inputs, for a general persistent homology with arbitrary filtration. Thus, our proposed layer can be placed anywhere in the network and feed critical information on the topological features of input data into subsequent layers to improve the learnability of the networks toward a given task. A task-optimal structure of PLLay is learned during training via backpropagation, without requiring any input featurization or data preprocessing. We provide a novel adaptation for the DTM function-based filtration, and show that the proposed layer is robust against noise and outliers through a stability analysis. We demonstrate the effectiveness of our approach by classification experiments on various datasets.

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

↑