mlsanityData to 7 Oct 2026

Linear Optimal Transport Embedding: Provable Wasserstein classification for certain rigid transformations and perturbations

arXiv 2008.09165 ↗First posted 20 Aug 2020stat.ML cs.LG math.OCcited by 37

Not on the map. Why?

Abstract (arXiv)

Discriminating between distributions is an important problem in a number of scientific fields. This motivated the introduction of Linear Optimal Transportation (LOT), which embeds the space of distributions into an L2-space. The transform is defined by computing the optimal transport of each distribution to a fixed reference distribution, and has a number of benefits when it comes to speed of computation and to determining classification boundaries. In this paper, we characterize a number of settings in which LOT embeds families of distributions into a space in which they are linearly separable. This is true in arbitrary dimension, and for families of distributions generated through perturbations of shifts and scalings of a fixed distribution.We also prove conditions under which the L2 distance of the LOT embedding between two distributions in arbitrary dimension is nearly isometric to Wasserstein-2 distance between those distributions. This is of significant computational benefit, as one must only compute N optimal transport maps to define the N2 pairwise distances between N distributions. We demonstrate the benefits of LOT on a number of distribution classification problems.

Key facts. Cited by 37 papers in the map (data through 7 Oct 2026). First posted on arXiv 20 Aug 2020.

Builds on

No reference list yet.

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2022: 6; 2023: 12; 2024: 9; 2025: 6; 2026: 4.

37 papers.

Sort:

By area:

  1. 2022Distribution Regression with Sliced Wasserstein Kernelscited by 18
  2. 2022Wassmap: Wasserstein Isometric Mapping for Image Manifold Learningcited by 15
  3. 2022Supervised learning of sheared distributions using linearized optimal transportcited by 14
  4. 2023Linearized Wasserstein dimensionality reduction with approximation guaranteescited by 12
  5. 2024Extended Flow Matching: a Method of Conditional Generation with Generalized Continuity Equationcited by 11
  6. 2023Wasserstein Mirror Gradient Flow as the limit of the Sinkhorn Algorithmcited by 10
  7. 2023Linear Optimal Partial Transport Embeddingcited by 8
  8. 2025Slicing the Gaussian Mixture Wasserstein Distancecited by 7
  9. 2022Gaussian Processes on Distributions based on Regularized Optimal Transportcited by 6
  10. 2023Applications of No-Collision Transportation Maps in Manifold Learningcited by 6
  11. 2023Measure transfer via stochastic slicing and matchingcited by 6
  12. 2023Manifold learning in Wasserstein spacecited by 6
25 more
  1. 2023Fast Optimal Transport through Sliced Wasserstein Generalized Geodesicscited by 5
  2. 2023LCOT: Linear circular optimal transportcited by 4
  3. 2022Geometric Sparse Coding in Wasserstein Spacecited by 3
  4. 2023Approximation properties of slice-matching operatorscited by 3
  5. 2025Normalized Radon Cumulative Distribution Transforms for Invariance and Robustness in Optimal Transport Based Image Classificationcited by 3
  6. 2023Statistical learning on measures: an application to persistence diagramscited by 2
  7. 2023Equivariant vs. Invariant Layers: A Comparison of Backbone and Pooling for Point Cloud Classificationcited by 2
  8. 2026Amortized Optimal Transport from Sliced Potentialscited by 2
  9. 2026One Operator for Many Densities: Amortized Approximation of Conditioning by Neural Operatorscited by 2
  10. 2023Discrete transforms of quantized persistence diagramscited by 1
  11. 2024Point Cloud Classification via Deep Set Linearized Optimal Transportcited by 1
  12. 2024Linear optimal transport subspaces for point set classificationcited by 1
  13. 2024Resistance Distance and Linearized Optimal Transport on Graphscited by 1
  14. 2024Low dimensional representation of multi-patient flow cytometry datasets using optimal transport for minimal residual disease detection in leukemiacited by 1
  15. 2024Linear Partial Gromov-Wasserstein Embeddingcited by 1
  16. 2024Linearized Wasserstein Barycenters: Synthesis, Analysis, Representational Capacity, and Applicationscited by 1
  17. 2025Scalable Learning from Probability Measures with Mean Measure Quantizationcited by 1
  18. 2022Geodesic Properties of a Generalized Wasserstein Embedding for Time Series Analysiscited by 0
  19. 2024Spectral Clustering for Discrete Distributionscited by 0
  20. 2024Using Linearized Optimal Transport to Predict the Evolution of Stochastic Particle Systemscited by 0
  21. 2025Embedding Empirical Distributions for Computing Optimal Transport Mapscited by 0
  22. 2025Linearized Optimal Transport for Analysis of High-Dimensional Point-Cloud and Single-Cell Datacited by 0
  23. 2025Generalizations of the Normalized Radon Cumulative Distribution Transform for Limited Data Recognitioncited by 0
  24. 2026Spectral-transport stability and benign overfitting for minimum norm interpolationcited by 0
  25. 2026Approximating Measures on Function Spaces: Transport and Truncationcited by 0