Lightspeed Geometric Dataset Distance via Sliced Optimal Transport
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
- 2015Deep Residual Learning for Image Recognitioncited by 51,809
- 2015Character-level Convolutional Networks for Text Classificationcited by 2,293
- 2013Sinkhorn Distances: Lightspeed Computation of Optimal Transportation Distancescited by 2,277
- 2017Near-linear time approximation algorithms for optimal transport via Sinkhorn iterationcited by 219
- 2019Task2Vec: Task Embedding for Meta-Learningcited by 197
- 2019Adaptive Gradient-Based Meta-Learning Methodscited by 183
- 2020Geometric Dataset Distances via Optimal Transportcited by 157
- 2019Transferability and Hardness of Supervised Classification Taskscited by 125
- 2021Continual Learning in the Teacher-Student Setup: Impact of Task Similaritycited by 86
- 2020Statistical and Topological Properties of Sliced Probability Divergencescited by 83
- 2021Continual Learning of a Mixed Sequence of Similar and Dissimilar Taskscited by 80
- 2021OTCE: A Transferability Metric for Cross-Domain Cross-Task Representationscited by 62
20 more
- 2020Wasserstein Embedding for Graph Learningcited by 56
- 2019Hierarchical Optimal Transport for Document Representationcited by 53
- 2022Statistical, Robustness, and Computational Guarantees for Sliced Wasserstein Distancescited by 41
- 2024Sliced-Wasserstein Distances and Flows on Cartan-Hadamard Manifoldscited by 28
- 2024The Joint Effect of Task Similarity and Overparameterization on Catastrophic Forgetting -- An Analytical Modelcited by 26
- 2022Revisiting Sliced Wasserstein on Images: From Vectorization to Convolutioncited by 25
- 2019Minimax Confidence Intervals for the Sliced Wasserstein Distancecited by 24
- 2022Wasserstein Task Embedding for Measuring Task Similaritiescited by 24
- 2023Quasi-Monte Carlo for 3D Sliced Wassersteincited by 22
- 2020Dataset Dynamics via Gradient Flows in Probability Spacecited by 18
- 2022Hyperbolic Sliced-Wasserstein via Geodesic and Horospherical Projectionscited by 16
- 2020An Information-Geometric Distance on the Space of Taskscited by 15
- 2024Stereographic Spherical Sliced Wasserstein Distancescited by 12
- 2024Parallelly Sliced Optimal Transport on Spheres and on the Rotation Groupcited by 10
- 2024Sharp bounds for max-sliced Wasserstein distancescited by 10
- 2022Hilbert Curve Projection Distance for Distribution Comparisoncited by 9
- 2024Validating Climate Models with Spherical Convolutional Wasserstein Distancecited by 9
- 2024Sliced-Wasserstein Estimation with Spherical Harmonics as Control Variatescited by 8
- 2024Hierarchical Hybrid Sliced Wasserstein: A Scalable Metric for Heterogeneous Joint Distributionscited by 6
- 2024Summarizing Bayesian Nonparametric Mixture Posterior -- Sliced Optimal Transport Metrics for Gaussian Mixturescited by 4
Built on by
Citing papers per year: 2025: 4; 2026: 6.
10 papers.
- 2025Slicing the Gaussian Mixture Wasserstein Distancecited by 7
- 2025Slicing Wasserstein Over Wasserstein Via Functional Optimal Transportcited by 5
- 2025Optimizing Distributional Geometry Alignment with Optimal Transport for Generative Dataset Distillationcited by 4
- 2025Busemann Functions in the Wasserstein Space: Existence, Closed-Forms, and Applications to Slicingcited by 1
- 2026Generalized Wasserstein Flow Matching: Transport Plans, Everywhere, All at Oncecited by 1
- 2026Geometry-Aware Dataset Condensation for Diffusion Model Trainingcited by 1
- 2026HOT-POT: Optimal Transport for Sparse Stereo Matchingcited by 0
- 2026RADAR: Relative Angular Divergence Across Representationscited by 0
- 2026Rethinking Transfer in Continual Learning: A Replay-Based Realisationcited by 0
- 2026Towards Truly Unsupervised Evaluation of Feature Selection -- Extended Versioncited by 0
- 2026Towards Truly Unsupervised Evaluation of Feature Selection -- Extended Version12 Aug 2026
- 2026Rethinking Transfer in Continual Learning: A Replay-Based Realisation17 Jul 2026
- 2026Geometry-Aware Dataset Condensation for Diffusion Model Training4 Jun 2026
- 2026RADAR: Relative Angular Divergence Across Representations21 May 2026
- 2026Generalized Wasserstein Flow Matching: Transport Plans, Everywhere, All at Once8 May 2026
- 2026HOT-POT: Optimal Transport for Sparse Stereo Matching18 Jan 2026
- 2025Optimizing Distributional Geometry Alignment with Optimal Transport for Generative Dataset Distillation29 Nov 2025
- 2025Busemann Functions in the Wasserstein Space: Existence, Closed-Forms, and Applications to Slicing6 Oct 2025
- 2025Slicing Wasserstein Over Wasserstein Via Functional Optimal Transport26 Sep 2025
- 2025Slicing the Gaussian Mixture Wasserstein Distance11 Apr 2025