mlsanityData to 14 Oct 2026

Pulling back symmetric Riemannian geometry for data analysis

arXiv 2403.06612 ↗First posted 11 Mar 2024math.DG cs.LGcited by 8

Not on the map. Why?

Abstract (arXiv)

Data sets tend to live in low-dimensional non-linear subspaces. Ideal data analysis tools for such data sets should therefore account for such non-linear geometry. The symmetric Riemannian geometry setting can be suitable for a variety of reasons. First, it comes with a rich mathematical structure to account for a wide range of non-linear geometries that has been shown to be able to capture the data geometry through empirical evidence from classical non-linear embedding. Second, many standard data analysis tools initially developed for data in Euclidean space can also be generalised efficiently to data on a symmetric Riemannian manifold. A conceptual challenge comes from the lack of guidelines for constructing a symmetric Riemannian structure on the data space itself and the lack of guidelines for modifying successful algorithms on symmetric Riemannian manifolds for data analysis to this setting. This work considers these challenges in the setting of pullback Riemannian geometry through a diffeomorphism. The first part of the paper characterises diffeomorphisms that result in proper, stable and efficient data analysis. The second part then uses these best practices to guide construction of such diffeomorphisms through deep learning. As a proof of concept, different types of pullback geometries -- among which the proposed construction -- are tested on several data analysis tasks and on several toy data sets. The numerical experiments confirm the predictions from theory, i.e., that the diffeomorphisms generating the pullback geometry need to map the data manifold into a geodesic subspace of the pulled back Riemannian manifold while preserving local isometry around the data manifold for proper, stable and efficient data analysis, and that pulling back positive curvature can be problematic in terms of stability.

Key facts. Cited by 8 papers in the map (data through 14 Oct 2026). Builds on 28 of its 85 references that are in the map. First posted on arXiv 11 Mar 2024.

Builds on

28 of 85 references.

References · 28

  1. 2018UMAP: Uniform Manifold Approximation and Projection for Dimension Reductioncited by 2,898
  2. 2015Fast and Accurate Deep Network Learning by Exponential Linear Units (ELUs)cited by 1,070
  3. 2017SphereFace: Deep Hypersphere Embedding for Face Recognitioncited by 737
  4. 2017Poincar'e Embeddings for Learning Hierarchical Representationscited by 684
  5. 2017Latent Space Oddity: on the Curvature of Deep Generative Modelscited by 174
  6. 2019Mixed-curvature Variational Autoencoderscited by 86
  7. 2017The Riemannian Geometry of Deep Generative Modelscited by 82
  8. 2017Metrics for Deep Generative Modelscited by 53
  9. 2020Geometrically Enriched Latent Spacescited by 45
  10. 2020Tree! I am no Tree! I am a Low Dimensional Hyperbolic Embeddingcited by 36
  11. 2019Chart Auto-Encoders for Manifold Structured Datacited by 33
  12. 2020Computationally Tractable Riemannian Manifolds for Graph Embeddingscited by 29
16 more
  1. 2014Metrics for Probabilistic Geometriescited by 28
  2. 2019Fast and Robust Shortest Paths on Manifolds Learned from Datacited by 25
  3. 2016A Locally Adaptive Normal Distributioncited by 23
  4. 2021Symmetric Spaces for Graph Embeddings: A Finsler-Riemannian Approachcited by 23
  5. 2018Only Bayes should learn a manifold (on the estimation of differential geometric structure from data)cited by 17
  6. 2017DIMAL: Deep Isometric Manifold Learning Using Sparse Geodesic Samplingcited by 16
  7. 2020Balancing Geometry and Density: Path Distances on High-Dimensional Datacited by 16
  8. 2019Hydra: A method for strain-minimizing hyperbolic embedding of network- and distance-based datacited by 11
  9. 2021A prior-based approximate latent Riemannian metriccited by 11
  10. 2022Spectral, Probabilistic, and Deep Metric Learning: Tutorial and Surveycited by 10
  11. 2018Parallel Transport Unfolding: A Connection-based Manifold Learning Approachcited by 9
  12. 2022GD-VAEs: Geometric Dynamic Variational Autoencoders for Learning Nonlinear Dynamics and Dimension Reductionscited by 7
  13. 2023Curvature corrected tangent space-based approximation of manifold-valued datacited by 6
  14. 2021How can classical multidimensional scaling go wrong?cited by 4
  15. 2019Fenchel Duality Theory and A Primal-Dual Algorithm on Riemannian Manifoldscited by 2
  16. 2021An Inexact Semi-smooth Newton Method on Riemannian Manifolds with Application to Duality-based Total Variation Denoisingcited by 2

Built on by

Cited by year (2026 to 14 Oct)

Citing papers per year: 2024: 2; 2025: 3; 2026: 3.

8 papers.