mlsanityData to 14 Oct 2026

Improving Mapper's Robustness by Varying Resolution According to Lens-Space Density

arXiv 2410.03862 ↗First posted 4 Oct 2024cs.LG math.AT stat.MLcited by 1

Not on the map. Why?

Abstract (arXiv)

We propose a modification of the Mapper algorithm that removes the assumption of a single resolution scale across semantic space and improves the robustness of the results under change of parameters. Our work is motivated by datasets where the density in the image of the Morse-type function (the lens-space density) varies widely. For such datasets, tuning the resolution parameter of Mapper is difficult because small changes can lead to significant variations in the output. By improving the robustness of the output under these variations, our method makes it easier to tune the resolution for datasets with highly variable lens-space density. This improvement is achieved by generalising the type of permitted cover for Mapper and incorporating the lens-space density into the cover. Furthermore, we prove that for covers satisfying natural assumptions, the graph produced by Mapper still converges in bottleneck distance to the Reeb graph of the Rips complex of the data, while possibly capturing more topological features than a standard Mapper cover. Finally, we discuss implementation details and present the results of computational experiments. We also provide an accompanying reference implementation.

Key facts. Cited by 1 paper in the map (data through 14 Oct 2026). Builds on 4 of its 12 references that are in the map. First posted on arXiv 4 Oct 2024.

Builds on

4 of 12 references.

References · 4

  1. 2017Statistical Analysis and Parameter Selection for Mappercited by 20
  2. 2015Convergence between Categorical Representations of Reeb Space and Mappercited by 3
  3. 2015Mutiscale Mapper: A Framework for Topological Summarization of Data and Mapscited by 2
  4. 2024Any Graph is a Mapper Graphcited by 1

Built on by

Cited by year

Citing papers per year: 2025: 1.

1 paper.