Principal Geodesic Analysis for Probability Measures under the Optimal Transport Metric
Not on the map. Why?
Abstract (arXiv)
Given a family of probability measures in P(X), the space of probability measures on a Hilbert space X, our goal in this paper is to highlight one ore more curves in P(X) that summarize efficiently that family. We propose to study this problem under the optimal transport (Wasserstein) geometry, using curves that are restricted to be geodesic segments under that metric. We show that concepts that play a key role in Euclidean PCA, such as data centering or orthogonality of principal directions, find a natural equivalent in the optimal transport geometry, using Wasserstein means and differential geometry. The implementation of these ideas is, however, computationally challenging. To achieve scalable algorithms that can handle thousands of measures, we propose to use a relaxed definition for geodesics and regularized optimal transport distances. The interest of our approach is demonstrated on images seen either as shapes or color histograms.
Key facts. Cited by 15 papers in the map (data through 7 Oct 2026). First posted on arXiv 26 Jun 2015.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2021: 2; 2022: 4; 2023: 2; 2024: 0; 2025: 5; 2026: 2.
15 papers.
Sort:
- 2022Curriculum Reinforcement Learning using Optimal Transport via Gradual Domain Adaptationcited by 28
- 2022Wasserstein K-means for clustering probability distributionscited by 16
- 2021Semi-Discrete Optimal Transport: Hardness, Regularization and Numerical Solutioncited by 13
- 2022Principal Geodesic Analysis of Merge Trees (and Persistence Diagrams)cited by 8
- 2023RDA-INR: Riemannian Diffeomorphic Autoencoding via Implicit Neural Representationscited by 7
- 2021Learning to Generate Wasserstein Barycenterscited by 6
- 2025Robust Sampling for Active Statistical Inferencecited by 5
- 2023Group-blind optimal transport to group parity and its constrained variantscited by 4
- 2022Geometric Sparse Coding in Wasserstein Spacecited by 3
- 2025On the Wasserstein Geodesic Principal Component Analysis of probability measurescited by 3
- 2025Manifold learning in metric spacescited by 2
- 2025Scalable Learning from Probability Measures with Mean Measure Quantizationcited by 1
3 more
- 2025Busemann Functions in the Wasserstein Space: Existence, Closed-Forms, and Applications to Slicingcited by 1
- 2026PCA of probability measures: Sparse and Dense sampling regimescited by 0
- 2026Another Look at Log-PCA for Probability Measures: A Dynamical Formulation and Statistical Convergencecited by 0
- 2026Another Look at Log-PCA for Probability Measures: A Dynamical Formulation and Statistical Convergence15 Jun 2026
- 2026PCA of probability measures: Sparse and Dense sampling regimes2 Feb 2026
- 2025Robust Sampling for Active Statistical Inference12 Nov 2025
- 2025Busemann Functions in the Wasserstein Space: Existence, Closed-Forms, and Applications to Slicing6 Oct 2025
- 2025On the Wasserstein Geodesic Principal Component Analysis of probability measures4 Jun 2025
- 2025Manifold learning in metric spaces20 Mar 2025
- 2025Scalable Learning from Probability Measures with Mean Measure Quantization7 Feb 2025
- 2023Group-blind optimal transport to group parity and its constrained variants17 Oct 2023
- 2023RDA-INR: Riemannian Diffeomorphic Autoencoding via Implicit Neural Representations22 May 2023
- 2022Geometric Sparse Coding in Wasserstein Space21 Oct 2022
- 2022Curriculum Reinforcement Learning using Optimal Transport via Gradual Domain Adaptation18 Oct 2022
- 2022Wasserstein K-means for clustering probability distributions14 Sep 2022
3 more
- 2022Curriculum Reinforcement Learning using Optimal Transport via Gradual Domain Adaptationcited by 28
- 2022Wasserstein K-means for clustering probability distributionscited by 16
- 2021Semi-Discrete Optimal Transport: Hardness, Regularization and Numerical Solutioncited by 13
- 2022Principal Geodesic Analysis of Merge Trees (and Persistence Diagrams)cited by 8
- 2023RDA-INR: Riemannian Diffeomorphic Autoencoding via Implicit Neural Representationscited by 7
- 2021Learning to Generate Wasserstein Barycenterscited by 6
- 2025Robust Sampling for Active Statistical Inferencecited by 5
- 2023Group-blind optimal transport to group parity and its constrained variantscited by 4
- 2022Geometric Sparse Coding in Wasserstein Spacecited by 3
- 2025On the Wasserstein Geodesic Principal Component Analysis of probability measurescited by 3
- 2025Manifold learning in metric spacescited by 2
- 2025Scalable Learning from Probability Measures with Mean Measure Quantizationcited by 1
12 most cited of 15 All 15 (JSON)
- 2026Another Look at Log-PCA for Probability Measures: A Dynamical Formulation and Statistical Convergence15 Jun 2026
- 2026PCA of probability measures: Sparse and Dense sampling regimes2 Feb 2026
- 2025Robust Sampling for Active Statistical Inference12 Nov 2025
- 2025Busemann Functions in the Wasserstein Space: Existence, Closed-Forms, and Applications to Slicing6 Oct 2025
- 2025On the Wasserstein Geodesic Principal Component Analysis of probability measures4 Jun 2025
- 2025Manifold learning in metric spaces20 Mar 2025
- 2025Scalable Learning from Probability Measures with Mean Measure Quantization7 Feb 2025
- 2023Group-blind optimal transport to group parity and its constrained variants17 Oct 2023
- 2023RDA-INR: Riemannian Diffeomorphic Autoencoding via Implicit Neural Representations22 May 2023
- 2022Geometric Sparse Coding in Wasserstein Space21 Oct 2022
- 2022Curriculum Reinforcement Learning using Optimal Transport via Gradual Domain Adaptation18 Oct 2022
- 2022Wasserstein K-means for clustering probability distributions14 Sep 2022
12 newest of 15 All 15 (JSON)