Geodesic Calculus on Implicitly Defined Latent Manifolds
Not on the map. Why?
Abstract (arXiv)
Latent manifolds of autoencoders provide low-dimensional representations of data, which can be studied from a geometric perspective. We propose to describe these latent manifolds as implicit submanifolds of some ambient latent space. Based on this, we develop tools for a discrete Riemannian calculus approximating classical geometric operators. These tools are robust against inaccuracies of the implicit representation often occurring in practical examples. To obtain a suitable implicit representation, we propose to learn an approximate projection onto the latent manifold by minimizing a denoising objective. This approach is independent of the underlying autoencoder and supports the use of different Riemannian geometries on the latent manifolds. The framework in particular enables the computation of geodesic paths connecting given end points and shooting geodesics via the Riemannian exponential maps on latent manifolds. We evaluate our approach on various autoencoders trained on synthetic and real data.
Key facts. Cited by 2 papers in the map (data through 7 Oct 2026). Builds on 25 of its 52 references that are in the map. First posted on arXiv 10 Oct 2025.
Builds on
25 of 52 references.
References · 25
- 2018BERT: Pre-training of Deep Bidirectional Transformers for Language Understandingcited by 40,204
- 2021High-Resolution Image Synthesis with Latent Diffusion Modelscited by 18,694
- 2015Fast and Accurate Deep Network Learning by Exponential Linear Units (ELUs)cited by 1,061
- 2018Hyperspherical Variational Auto-Encoderscited by 188
- 2017Latent Space Oddity: on the Curvature of Deep Generative Modelscited by 169
- 2022Pose-NDF: Modeling Human Pose Manifolds with Neural Distance Fieldscited by 85
- 2017The Riemannian Geometry of Deep Generative Modelscited by 81
- 2017Metrics for Deep Generative Modelscited by 53
- 2020Geometrically Enriched Latent Spacescited by 45
- 2024Where Do We Stand with Implicit Neural Representations? A Technical and Performance Surveycited by 41
- 2014Metrics for Probabilistic Geometriescited by 28
- 2022Pythae: Unifying Generative Autoencoders in Python -- A Benchmarking Use Casecited by 26
13 more
- 2019Fast and Robust Shortest Paths on Manifolds Learned from Datacited by 25
- 2016A Locally Adaptive Normal Distributioncited by 23
- 2021Pulling back information geometrycited by 23
- 2024Geometry-Aware Generative Autoencoders for Warped Riemannian Metric Learning and Generative Modeling on Data Manifoldscited by 13
- 2025A Review on Riemannian Metric Learning: Closer to You than You Imaginecited by 13
- 2023Fermat Distances: Metric Approximation, Spectral Convergence, and Clustering Algorithmscited by 12
- 2019Power Weighted Shortest Paths for Clustering Euclidean Datacited by 10
- 2024Learning Distances from Data with Normalizing Flows and Score Matchingcited by 10
- 2025Probability Density Geodesics in Image Diffusion Latent Spacecited by 9
- 2025Hessian Geometry of Latent Space in Generative Modelscited by 9
- 2022Convergent autoencoder approximation of low bending and low distortion manifold embeddingscited by 4
- 2019Geometric optimization using nonlinear rotation-invariant coordinatescited by 2
- 2022Identifying latent distances with Finslerian geometrycited by 2
Built on by
Citing papers per year: 2026: 2.
2 papers.