mlsanityData to 7 Oct 2026

Lightspeed Geometric Dataset Distance via Sliced Optimal Transport

arXiv 2501.18901 ↗First posted 31 Jan 2025cs.LG cs.AI stat.COcited by 10

Not on the map. Why?

Abstract (arXiv)

We introduce sliced optimal transport dataset distance (s-OTDD), a model-agnostic, embedding-agnostic approach for dataset comparison that requires no training, is robust to variations in the number of classes, and can handle disjoint label sets. The core innovation is Moment Transform Projection (MTP), which maps a label, represented as a distribution over features, to a real number. Using MTP, we derive a data point projection that transforms datasets into one-dimensional distributions. The s-OTDD is defined as the expected Wasserstein distance between the projected distributions, with respect to random projection parameters. Leveraging the closed form solution of one-dimensional optimal transport, s-OTDD achieves (near-)linear computational complexity in the number of data points and feature dimensions and is independent of the number of classes. With its geometrically meaningful projection, s-OTDD strongly correlates with the optimal transport dataset distance while being more efficient than existing dataset discrepancy measures. Moreover, it correlates well with the performance gap in transfer learning and classification accuracy in data augmentation.

Key facts. Cited by 10 papers in the map (data through 7 Oct 2026). Builds on 32 of its 51 references that are in the map. First posted on arXiv 31 Jan 2025.

Builds on

32 of 51 references.

References · 32

  1. 2015Deep Residual Learning for Image Recognitioncited by 51,809
  2. 2015Character-level Convolutional Networks for Text Classificationcited by 2,293
  3. 2013Sinkhorn Distances: Lightspeed Computation of Optimal Transportation Distancescited by 2,277
  4. 2017Near-linear time approximation algorithms for optimal transport via Sinkhorn iterationcited by 219
  5. 2019Task2Vec: Task Embedding for Meta-Learningcited by 197
  6. 2019Adaptive Gradient-Based Meta-Learning Methodscited by 183
  7. 2020Geometric Dataset Distances via Optimal Transportcited by 157
  8. 2019Transferability and Hardness of Supervised Classification Taskscited by 125
  9. 2021Continual Learning in the Teacher-Student Setup: Impact of Task Similaritycited by 86
  10. 2020Statistical and Topological Properties of Sliced Probability Divergencescited by 83
  11. 2021Continual Learning of a Mixed Sequence of Similar and Dissimilar Taskscited by 80
  12. 2021OTCE: A Transferability Metric for Cross-Domain Cross-Task Representationscited by 62
20 more
  1. 2020Wasserstein Embedding for Graph Learningcited by 56
  2. 2019Hierarchical Optimal Transport for Document Representationcited by 53
  3. 2022Statistical, Robustness, and Computational Guarantees for Sliced Wasserstein Distancescited by 41
  4. 2024Sliced-Wasserstein Distances and Flows on Cartan-Hadamard Manifoldscited by 28
  5. 2024The Joint Effect of Task Similarity and Overparameterization on Catastrophic Forgetting -- An Analytical Modelcited by 26
  6. 2022Revisiting Sliced Wasserstein on Images: From Vectorization to Convolutioncited by 25
  7. 2019Minimax Confidence Intervals for the Sliced Wasserstein Distancecited by 24
  8. 2022Wasserstein Task Embedding for Measuring Task Similaritiescited by 24
  9. 2023Quasi-Monte Carlo for 3D Sliced Wassersteincited by 22
  10. 2020Dataset Dynamics via Gradient Flows in Probability Spacecited by 18
  11. 2022Hyperbolic Sliced-Wasserstein via Geodesic and Horospherical Projectionscited by 16
  12. 2020An Information-Geometric Distance on the Space of Taskscited by 15
  13. 2024Stereographic Spherical Sliced Wasserstein Distancescited by 12
  14. 2024Parallelly Sliced Optimal Transport on Spheres and on the Rotation Groupcited by 10
  15. 2024Sharp bounds for max-sliced Wasserstein distancescited by 10
  16. 2022Hilbert Curve Projection Distance for Distribution Comparisoncited by 9
  17. 2024Validating Climate Models with Spherical Convolutional Wasserstein Distancecited by 9
  18. 2024Sliced-Wasserstein Estimation with Spherical Harmonics as Control Variatescited by 8
  19. 2024Hierarchical Hybrid Sliced Wasserstein: A Scalable Metric for Heterogeneous Joint Distributionscited by 6
  20. 2024Summarizing Bayesian Nonparametric Mixture Posterior -- Sliced Optimal Transport Metrics for Gaussian Mixturescited by 4

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2025: 4; 2026: 6.

10 papers.