Robust Barycenters of Persistence Diagrams
Keanu Sisouk, Eloi Tanguy, Julie Delon, Julien Tierny
TL;DR
This work addresses the sensitivity of persistence-diagram barycenters to outliers by generalizing Wasserstein barycenters to generic transport costs with $q>1$. It adapts a fixed-point method to compute robust barycenters via a two-step optimization: assignment and a gradient-based ground-barycenter update using $\mathfrak{b}_q$, ensuring nonincreasing Fréchet energy under suitable conditions. The framework is validated on clustering and Wasserstein dictionary encoding tasks, with empirical evidence that lower values of $q$ (e.g., $q$ in $[1.2,1.4]$) yield stronger robustness to outliers while maintaining representational quality. The authors provide a PyTorch-enabled implementation and demonstrate practical benefits for real-life ensembles of persistence diagrams, highlighting potential extensions to other topological descriptors.
Abstract
This short paper presents a general approach for computing robust Wasserstein barycenters of persistence diagrams. The classical method consists in computing assignment arithmetic means after finding the optimal transport plans between the barycenter and the persistence diagrams. However, this procedure only works for the transportation cost related to the $q$-Wasserstein distance $W_q$ when $q=2$. We adapt an alternative fixed-point method to compute a barycenter diagram for generic transportation costs ($q > 1$), in particular those robust to outliers, $q \in (1,2)$. We show the utility of our work in two applications: \emph{(i)} the clustering of persistence diagrams on their metric space and \emph{(ii)} the dictionary encoding of persistence diagrams. In both scenarios, we demonstrate the added robustness to outliers provided by our generalized framework. Our Python implementation is available at this address: https://github.com/Keanu-Sisouk/RobustBarycenter .
