mlsanityData to 14 Oct 2026

ToMAToMP: Robust and Multi-Parameter Topological Clustering

arXiv 2605.14824 ↗First posted 14 May 2026cs.LG math.ATcited by 0

Not on the map. Why?

Abstract (arXiv)

Topological clustering, and its main algorithm ToMATo, is a clustering method from Topological Data Analysis (TDA) which has been applied successfully in several applications during the last few years. This is due to its high versatility, as clusters are detected from the persistent components in the sublevel sets of any user-defined function (gene expression, pixel values, etc), and efficiency, as topological clustering enjoys robustness guarantees. However, ToMATo is also limited in several ways. First, a graph on the data points needs to be provided as a hyper-parameter of the method (whose fine-tuning is left to the user). Second, ToMATo is known to be very sensitive to outlier values in the function range. Finally, and most importantly, ToMATo can only handle one function at a time, whereas it is critical to use several functions in various applications. In this article, we introduce ToMAToMP: the first topological clustering method able to handle several functions at the same time with theoretical guarantees. More specifically, we leverage a recent tool from multi-parameter persistent homology, called MMA decomposition, to design our clustering algorithm, and prove that it enjoys robustness properties. As corollaries, we show that it can be used to make ToMATo independent of graph tuning, and robust to outliers. Finally, we provide a set of numerical experiments showcasing the efficiency and quality of the clusterings produced by ToMAToMP, by showing strong improvement over non-topological and topological baselines for various datasets.

Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 7 of its 27 references that are in the map. First posted on arXiv 14 May 2026.

Builds on

7 of 27 references.

References · 7

  1. 2017Extracting Persistent Clusters in Dynamic Data via M"obius inversioncited by 5
  2. 2014The rank invariant stability via interleavingscited by 4
  3. 2022Multi-parameter Module Approximation: an efficient and interpretable invariant for multi-parameter persistence modules with guaranteescited by 4
  4. 2020Stable and consistent density-based clustering via multiparameter persistencecited by 3
  5. 2023Computing Zigzag Vineyard Efficiently Including Expansions and Contractionscited by 3
  6. 2024AuToMATo: An Out-Of-The-Box Persistence-Based Clustering Algorithmcited by 3
  7. 2023Pruning vineyards: updating barcodes and representative cycles by removing simplicescited by 1

Built on by

Not cited yet.