Article thumbnail

Large Scale computation of Means and Clusters for Persistence Diagrams using Optimal Transport

By Théo Lacombe, Marco Cuturi and Steve Oudot

Abstract

Persistence diagrams (PDs) are now routinely used to summarize the underlying topology of complex data. Despite several appealing properties, incorporating PDs in learning pipelines can be challenging because their natural geometry is not Hilbertian. Indeed, this was recently exemplified in a string of papers which show that the simple task of averaging a few PDs can be computationally prohibitive. We propose in this article a tractable framework to carry out standard tasks on PDs at scale, notably evaluating distances, estimating barycenters and performing clustering. This framework builds upon a reformulation of PD metrics as optimal transport (OT) problems. Doing so, we can exploit recent computational advances: the OT problem on a planar grid, when regularized with entropy, is convex can be solved in linear time using the Sinkhorn algorithm and convolutions. This results in scalable computations that can stream on GPUs. We demonstrate the efficiency of our approach by carrying out clustering with diagrams metrics on several thousands of PDs, a scale never seen before in the literature.Comment: 17 pages, 9 figures (9 pages for the main content). To appear in NIPS 2018 proceedings. Version updated following reviewing process: correction of typo, clarification of some details, addition of two illustrations (Fig.1 and 7 in this version

Topics: Statistics - Machine Learning, Computer Science - Computational Geometry, Computer Science - Machine Learning
Year: 2018
OAI identifier: oai:arXiv.org:1805.08331

Suggested articles


To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.