Linearized optimal transport on manifolds
Not on the map. Why?
Abstract (arXiv)
Optimal transport is a geometrically intuitive, robust and flexible metric for sample comparison in data analysis and machine learning. Its formal Riemannian structure allows for a local linearization via a tangent space approximation. This in turn leads to a reduction of computational complexity and simplifies combination with other methods that require a linear structure. Recently this approach has been extended to the unbalanced Hellinger--Kantorovich (HK) distance. In this article we further extend the framework in various ways, including measures on manifolds, the spherical HK distance, a study of the consistency of discretization via the barycentric projection, and the continuity properties of the logarithmic map for the HK distance.
Key facts. Cited by 6 papers in the map (data through 13 Oct 2026). First posted on arXiv 24 Mar 2023.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2023: 2; 2024: 2; 2025: 0; 2026: 2.
6 papers.
- 2023Manifold learning in Wasserstein spacecited by 6
- 2023LCOT: Linear circular optimal transportcited by 4
- 2024Resistance Distance and Linearized Optimal Transport on Graphscited by 2
- 2026Generalized Wasserstein Flow Matching: Transport Plans, Everywhere, All at Oncecited by 2
- 2024Fused Gromov-Wasserstein Variance Decomposition with Linear Optimal Transportcited by 0
- 2026Barycentric Projections of Optimal Transport Plans on Riemannian Manifoldscited by 0
- 2026Barycentric Projections of Optimal Transport Plans on Riemannian Manifolds6 Jun 2026
- 2026Generalized Wasserstein Flow Matching: Transport Plans, Everywhere, All at Once8 May 2026
- 2024Fused Gromov-Wasserstein Variance Decomposition with Linear Optimal Transport15 Nov 2024
- 2024Resistance Distance and Linearized Optimal Transport on Graphs23 Apr 2024
- 2023Manifold learning in Wasserstein space14 Nov 2023
- 2023LCOT: Linear circular optimal transport9 Oct 2023