mlsanityData to 14 Oct 2026

Fused Gromov-Wasserstein Variance Decomposition with Linear Optimal Transport

arXiv 2411.10204 ↗First posted 15 Nov 2024stat.ME cs.LGcited by 0

Not on the map. Why?

Abstract (arXiv)

Wasserstein distances form a family of metrics on spaces of probability measures that have recently seen many applications. However, statistical analysis in these spaces is complex due to the nonlinearity of Wasserstein spaces. One potential solution to this problem is Linear Optimal Transport (LOT). This method allows one to find a Euclidean embedding, called LOT embedding, of measures in some Wasserstein spaces, but some information is lost in this embedding. So, to understand whether statistical analysis relying on LOT embeddings can make valid inferences about original data, it is helpful to quantify how well these embeddings describe that data. To answer this question, we present a decomposition of the Fr'echet variance of a set of measures in the 2-Wasserstein space, which allows one to compute the percentage of variance explained by LOT embeddings of those measures. We then extend this decomposition to the Fused Gromov-Wasserstein setting. We also present several experiments that explore the relationship between the dimension of the LOT embedding, the percentage of variance explained by the embedding, and the classification accuracy of machine learning classifiers built on the embedded data. We use the MNIST handwritten digits dataset, IMDB-50000 dataset, and Diffusion Tensor MRI images for these experiments. Our results illustrate the effectiveness of low dimensional LOT embeddings in terms of the percentage of variance explained and the classification accuracy of models built on the embedded data.

Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 23 of its 55 references that are in the map. First posted on arXiv 15 Nov 2024.

Builds on

23 of 55 references.

References · 23

  1. 2013Sinkhorn Distances: Lightspeed Computation of Optimal Transportation Distancescited by 2,316
  2. 2018Computational Optimal Transportcited by 780
  3. 2015Optimal Transport for Domain Adaptationcited by 463
  4. 2017Learning Generative Models with Sinkhorn Divergencescited by 314
  5. 2013Fast Computation of Wasserstein Barycenterscited by 216
  6. 2018Optimal Transport for structured data with application on graphscited by 172
  7. 2021Sinkformers: Transformers with Doubly Stochastic Attentioncited by 138
  8. 2018Fused Gromov-Wasserstein distance for structured objects: theoretical foundations and mathematical propertiescited by 93
  9. 2019A Wasserstein-type distance in the space of Gaussian Mixture Modelscited by 75
  10. 2018geomstats: a Python Package for Riemannian Geometry in Machine Learningcited by 71
  11. 2023Recent Advances in Optimal Transport for Machine Learningcited by 66
  12. 2024Statistical optimal transportcited by 47
11 more
  1. 2017Optimal Transport for Diffeomorphic Registrationcited by 39
  2. 2020Generalized Spectral Clustering via Gromov-Wasserstein Learningcited by 38
  3. 2019Sinkhorn Barycenters with Free Support via Frank-Wolfe Algorithmcited by 27
  4. 2015Discrete Wasserstein Barycenters: Optimal Transport for Discrete Datacited by 20
  5. 2021Fast and Scalable Optimal Transport for Brain Tractogramscited by 12
  6. 2019Gromov-Wasserstein Averaging in a Riemannian Frameworkcited by 9
  7. 2022On a linear fused Gromov-Wasserstein distance for graph structured datacited by 9
  8. 2023Linear Optimal Partial Transport Embeddingcited by 8
  9. 2023Linearized optimal transport on manifoldscited by 6
  10. 2017Log-PCA versus Geodesic PCA of histograms in the Wasserstein spacecited by 5
  11. 2023A Wasserstein-type Distance for Gaussian Mixtures on Vector Bundles with Applications to Shape Analysiscited by 3

Built on by

Not cited yet.