Atlas-based Manifold Representations for Interpretable Riemannian Machine Learning
Not on the map. Why?
Abstract (arXiv)
Despite the popularity of the manifold hypothesis, current manifold-learning methods do not support machine learning directly on the latent d-dimensional data manifold, as they primarily aim to perform dimensionality reduction into ℝD, losing key manifold features when the embedding dimension D approaches d. On the other hand, methods that directly learn the latent manifold as a differentiable atlas have been relatively underexplored. In this paper, we aim to give a proof of concept of the effectiveness and potential of atlas-based methods. To this end, we implement a generic data structure to maintain a differentiable atlas that enables Riemannian optimization over the manifold. We complement this with an unsupervised heuristic that learns a differentiable atlas from point cloud data. We experimentally demonstrate that this approach has advantages in terms of efficiency and accuracy in selected settings. Moreover, in a supervised classification task over the Klein bottle and in RNA velocity analysis of hematopoietic data, we showcase the improved interpretability and robustness of our approach.
Key facts. Cited by 1 paper in the map (data through 14 Oct 2026). Builds on 16 of its 62 references that are in the map. First posted on arXiv 20 Oct 2025.
Builds on
16 of 62 references.
References · 16
- 2021The Intrinsic Dimension of Images and Its Impact on Learningcited by 315
- 2022Riemannian Score-Based Generative Modellingcited by 219
- 2023SE(3) diffusion model with application to protein backbone generationcited by 219
- 2019Ripser: efficient computation of Vietoris-Rips persistence barcodescited by 117
- 2016Pymanopt: A Python Toolbox for Optimization on Manifolds using Automatic Differentiationcited by 94
- 2023Manifold learning: what, how, and whycited by 68
- 2022Manifold Interpolating Optimal-Transport Flows for Trajectory Inferencecited by 64
- 2022Verifying the Union of Manifolds Hypothesis for Image Datacited by 64
- 2016The non-convex Burer-Monteiro approach works on smooth semidefinite programscited by 46
- 2020Fast and Eager k-Medoids Clustering: O(k) Runtime Improvement of the PAM, CLARA, and CLARANS Algorithmscited by 36
- 2023Generative Modeling on Manifolds Through Mixture of Riemannian Diffusion Processescited by 21
- 2017An Alternative to EM for Gaussian Mixture Models: Batch and Stochastic Riemannian Optimizationcited by 20
4 more
- 2019On the Burer-Monteiro method for general semidefinite programscited by 8
- 2018Manifold Coordinates with Physical Meaningcited by 7
- 2017Principal Boundary on Riemannian Manifoldscited by 3
- 2025Efficient Diffusion Models for Symmetric Manifoldscited by 2
Built on by
Citing papers per year: 2026: 1.
1 paper.