Revisiting the Sliced Wasserstein Kernel for persistence diagrams: a Figalli-Gigli approach
Marc Janthial, Théo Lacombe
TL;DR
The paper addresses kernel-based learning with persistence diagrams by revisiting the distance underpinning the Sliced Wasserstein Kernel and replacing the Wasserstein-based slice with the Figalli–Gigli distance, yielding the Sliced Figalli–Gigli distance (SFG_p). This approach preserves the strong geometric alignment with persistence diagrams, extends naturally to infinite diagrams and persistence measures, and comes with stability guarantees and efficient computation. The authors show that the induced SFG_p kernel is positive definite (for p ∈ [1,2]) and topologically equivalent to FG_p, enabling Hilbert-space embeddings while retaining the intrinsic PD geometry. Empirically, SFGK performs on par with SWK on benchmark tasks such as orbit recognition and texture classification, while offering a broader, measure-theoretic framework and potential for generalizations. Overall, the work provides a theoretically sound and practically viable refinement of sliced distances for persistence diagrams with broader applicability and robustness to diagram size.
Abstract
The Sliced Wasserstein Kernel (SWK) for persistence diagrams was introduced in (Carri{è}re et al. 2017) as a powerful tool to implicitly embed persistence diagrams in a Hilbert space with reasonable distortion. This kernel is built on the intuition that the Figalli-Gigli distance-that is the partial matching distance routinely used to compare persistence diagrams-resembles the Wasserstein distance used in the optimal transport literature, and that the later could be sliced to define a positive definite kernel on the space of persistence diagrams. This efficient construction nonetheless relies on ad-hoc tweaks on the Wasserstein distance to account for the peculiar geometry of the space of persistence diagrams. In this work, we propose to revisit this idea by directly using the Figalli-Gigli distance instead of the Wasserstein one as the building block of our kernel. On the theoretical side, our sliced Figalli-Gigli kernel (SFGK) shares most of the important properties of the SWK of Carri{è}re et al., including distortion results on the induced embedding and its ease of computation, while being more faithful to the natural geometry of persistence diagrams. In particular, it can be directly used to handle infinite persistence diagrams and persistence measures. On the numerical side, we show that the SFGK performs as well as the SWK on benchmark applications.
