Applications of No-Collision Transportation Maps in Manifold Learning
Not on the map. Why?
Abstract (arXiv)
In this work, we investigate applications of no-collision transportation maps introduced in [Nurbekyan et. al., 2020] in manifold learning for image data. Recently, there has been a surge in applying transportation-based distances and features for data representing motion-like or deformation-like phenomena. Indeed, comparing intensities at fixed locations often does not reveal the data structure. No-collision maps and distances developed in [Nurbekyan et. al., 2020] are sensitive to geometric features similar to optimal transportation (OT) maps but much cheaper to compute due to the absence of optimization. In this work, we prove that no-collision distances provide an isometry between translations (respectively dilations) of a single probability measure and the translation (respectively dilation) vectors equipped with a Euclidean distance. Furthermore, we prove that no-collision transportation maps, as well as OT and linearized OT maps, do not in general provide an isometry for rotations. The numerical experiments confirm our theoretical findings and show that no-collision distances achieve similar or better performance on several manifold learning tasks compared to other OT and Euclidean-based methods at a fraction of a computational cost.
Key facts. Cited by 6 papers in the map (data through 7 Oct 2026). Builds on 16 of its 52 references that are in the map. First posted on arXiv 1 Apr 2023.
Builds on
16 of 52 references.
References · 16
- 2013Sinkhorn Distances: Lightspeed Computation of Optimal Transportation Distancescited by 2,277
- 2018Computational Optimal Transportcited by 765
- 2018Gromov-Wasserstein Alignment of Word Embedding Spacescited by 119
- 2018Massively scalable Sinkhorn distances via the Nystr"om methodcited by 40
- 2020Linear Optimal Transport Embedding: Provable Wasserstein classification for certain rigid transformations and perturbationscited by 37
- 2019On the Efficiency of Entropic Regularized Algorithms for Optimal Transportcited by 34
- 2015The Radon cumulative distribution transform and its application to image classificationcited by 28
- 2015The Cumulative Distribution Transform and Linear Pattern Classificationcited by 19
- 2017Multiscale Strategies for Computing Optimal Transportcited by 18
- 2015A Sparse Multi-Scale Algorithm for Dense Optimal Transportcited by 16
- 2022Wassmap: Wasserstein Isometric Mapping for Image Manifold Learningcited by 15
- 2022Supervised learning of sheared distributions using linearized optimal transportcited by 14
4 more
- 2023Linearized Wasserstein dimensionality reduction with approximation guaranteescited by 12
- 2020Manifold learning with arbitrary normscited by 10
- 2019No-collision Transportation Mapscited by 5
- 2020Domain decomposition for entropy regularized optimal transportcited by 4
Built on by
Citing papers per year: 2023: 4; 2024: 0; 2025: 1; 2026: 1.
6 papers.
- 2023Measure transfer via stochastic slicing and matchingcited by 6
- 2023Manifold learning in Wasserstein spacecited by 6
- 2025Manifold learning in metric spacescited by 2
- 2023On Wasserstein distances for affine transformations of random vectorscited by 0
- 2023Structured Approximations of Measurescited by 0
- 2026SRRM: Improving Recursive Transport Surrogates in the Small-Discrepancy Regimecited by 0
- 2026SRRM: Improving Recursive Transport Surrogates in the Small-Discrepancy Regime19 Mar 2026
- 2025Manifold learning in metric spaces20 Mar 2025
- 2023Manifold learning in Wasserstein space14 Nov 2023
- 2023Structured Approximations of Measures13 Oct 2023
- 2023On Wasserstein distances for affine transformations of random vectors5 Oct 2023
- 2023Measure transfer via stochastic slicing and matching11 Jul 2023