Lightspeed Geometric Dataset Distance via Sliced Optimal Transport
Khai Nguyen, Hai Nguyen, Tuan Pham, Nhat Ho
Abstract
We introduce sliced optimal transport dataset distance (s-OTDD), a model-agnostic, embeddingagnostic 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 onedimensional 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.
Ask about this paper
Your agent reads all of it.
Lune indexed this paper to the last equation, along with the top-tier papers that cite it. Ask a question and the answer quotes them.
Your agent calls
Luneget_paper_fulltext
Free to start. No credit card required.
Terminal
Install the CLIlune papers fulltext cff22ad3-97ee-4591-84d9-b8378fdbe9e9Cited by top-tier papers5
- Optimizing Distributional Geometry Alignment with Optimal Transport for Generative Dataset DistillationXiao Cui, Yulei Qin, Wengang Zhou, Hongsheng Li et al.NeurIPS 2025 · 5 citations
- Slicing Wasserstein over Wasserstein via Functional Optimal TransportMoritz Piening, Robert BeinertICLR 2026 · 5 citations
- A Novel Sliced Fused Gromov-Wasserstein DistanceMoritz Piening, Robert BeinertAAAI 2026 · 3 citations
- Flowing Datasets with Wasserstein over Wasserstein Gradient FlowsClément Bonet, Christophe Vauthier, Anna KorbaICML 2025
- Geometry-Aware Dataset Condensation for Diffusion Model TrainingXiao Cui, Yulei Qin, Mo Zhu, Wengang Zhou et al.ICML 2026
Builds on17
- Task2Vec: Task Embedding for Meta-LearningAlessandro Achille, Michael Lam, Rahul Tewari, Avinash Ravichandran et al.ICCV 2019 · 359 citations
- Geometric Dataset Distances via Optimal TransportDavid Alvarez-Melis, Nicolò FusiNeurIPS 2020 · 267 citations
- Transferability and Hardness of Supervised Classification TasksAnh Tuan Tran, Cuong V. Nguyen, Tal HassnerICCV 2019 · 201 citations
- Continual Learning of a Mixed Sequence of Similar and Dissimilar TasksZixuan Ke, Bing Liu, Xingchang HuangNeurIPS 2020 · 173 citations
- Statistical and Topological Properties of Sliced Probability DivergencesKimia Nadjahi, Alain Durmus, Lénaïc Chizat, Soheil Kolouri et al.NeurIPS 2020 · 115 citations
Related papers
- Run-Sort-ReRun: Escaping Batch Size Limitations in Sliced Wasserstein Generative ModelsJosé Lezama, Wei Chen, Qiang QiuICML 2021 · 9 citations
- Distribution Regression with Sliced Wasserstein KernelsDimitri Meunier, Massimiliano Pontil, Carlo CilibertoICML 2022 · 24 citations
- Point-set Distances for Learning Representations of 3D Point CloudsTrung Nguyen, Quang-Hieu Pham, Tam Le, Tung Pham et al.ICCV 2021 · 89 citations
- Dataset Distillation via the Wasserstein MetricHaoyang Liu, Yijiang Li, Tiancheng Xing, Peiran Wang et al.ICCV 2025 · 39 citations
- Fast Optimal Transport through Sliced Generalized Wasserstein GeodesicsGuillaume Mahey, Laetitia Chapel, Gilles Gasso, Clément Bonet et al.NeurIPS 2023 · 18 citations
