Fetching the paper…
Reading the bibliography…
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.
Estimating the parameter in a conditional poisson distribution
Cohen, A. C · 1960
Earlier work this paper cites.
II: Fourier analysis, self-adjointness , volume 2
Reed, M. and Simon, B · 1975
Earlier work this paper cites.
Gradient-based learning applied to document recognition
LeCun, Y., Bottou, L., Bengio, Y., and Haffner, P · 1998
Earlier work this paper cites.
Multidimensional scaling
Cox, T. F. and Cox, M. A · 2000
Earlier work this paper cites.
Predicting relative performance of classifiers from samples
Leite, R. and Brazdil, P · 2005
Earlier work this paper cites.
Analysis of representations for domain adaptation
Ben-David, S., Blitzer, J., Crammer, K., and Pereira, F · 2006
Earlier work this paper cites.
Optimal transport: old and new , volume 338
Villani, C · 2008
Earlier work this paper cites.
Learning multiple layers of features from tiny images
Krizhevsky, A., Hinton, G., et al · 2009
Earlier work this paper cites.
Domain adaptation: Learning bounds and algorithms
Mansour, Y., Mohri, M., and Rostamizadeh, A · 2009
Earlier work this paper cites.
An introduction to orthogonal polynomials
Chihara, T. S · 2011
Earlier work this paper cites.
The Radon transform on r n
Helgason, S · 2011
Earlier work this paper cites.
The mnist database of handwritten digit images for machine learning research [best of the web]
Deng, L · 2012
Earlier work this paper cites.
Wasserstein barycenter and its application to texture mixing
Rabin, J., Peyré, G., Delon, J., and Bernot, M · 2012
Earlier work this paper cites.
Sinkhorn distances: Lightspeed computation of optimal transport
Cuturi, M · 2013
Earlier work this paper cites.
A linear optimal transportation framework for quantifying and visualizing variations in sets of images
Wang, W., Slepčev, D., Basu, S., Ozolek, J. A., and Rohde, G. K · 2013
Earlier work this paper cites.
Sliced and Radon Wasserstein barycenters of measures
Bonneel, N., Rabin, J., Peyré, G., and Pfister, H · 2015
Earlier work this paper cites.
Tiny imagenet visual recognition challenge
Le, Y. and Yang, X · 2015
Earlier work this paper cites.
Character-level convolutional networks for text classification
Zhang, X., Zhao, J., and LeCun, Y · 2015
Earlier work this paper cites.
Deep residual learning for image recognition
He, K., Zhang, X., Ren, S., and Sun, J · 2016
Cited alongside, same era.
Near-linear time approximation algorithms for optimal transport via Sinkhorn iteration
Altschuler, J., Niles-Weed, J., and Rigollet, P · 2017
Cited alongside, same era.
Task2vec: Task embedding for meta-learning
Achille, A., Lam, M., Tewari, R., Ravichandran, A., Maji, S., Fowlkes, C. C., Soatto, S., and Perona, P · 2019
Cited alongside, same era.
Adaptive gradient-based meta-learning methods
Khodak, M., Balcan, M.-F. F., and Talwalkar, A. S · 2019
Cited alongside, same era.
Transferability and hardness of supervised classification tasks
Tran, A. T., Nguyen, C. V., and Hassner, T · 2019
Cited alongside, same era.
Hierarchical optimal transport for document representation
Yurochkin, M., Claici, S., Chien, E., Mirzazadeh, F., and Solomon, J. M · 2019
Revisiting sliced Wasserstein on images: From vectorization to convolution
Nguyen, K. and Ho, N · 2022
Later among the works it cites.
Statistical, robustness, and computational guarantees for sliced Wasserstein distances
Nietert, S., Sadhu, R., Goldfeld, Z., and Kato, K · 2022
Later among the works it cites.
Hyperbolic sliced-Wasserstein via geodesic and horospherical projections
Bonet, C., Chapel, L., Drumetz, L., and Courty, N · 2023
Later among the works it cites.
Sliced Wasserstein estimator with control variates
Nguyen, K. and Ho, N · 2023
Later among the works it cites.
Sliced optimal transport on the sphere
Quellmalz, M., Beinert, R., and Steidl, G · 2023
Later among the works it cites.
Cross domain lifelong learning based on task similarity
Yang, S. and Cai, Z · 2023
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Cited alongside, same era.
Geometric dataset distances via optimal transport
Alvarez-Melis, D. and Fusi, N · 2020
Cited alongside, same era.
Continual learning of a mixed sequence of similar and dissimilar tasks
Ke, Z., Liu, B., and Huang, X · 2020
Cited alongside, same era.
Statistical and topological properties of sliced probability divergences
Nadjahi, K., Durmus, A., Chizat, L., Kolouri, S., Shahrampour, S., and Simsekli, U · 2020
Cited alongside, same era.
Computational optimal transport, 2020
Peyré, G. and Cuturi, M · 2020
Cited alongside, same era.
Dataset dynamics via gradient flows in probability space
Alvarez-Melis, D. and Fusi, N · 2021
Cited alongside, same era.
An information-geometric distance on the space of tasks
Gao, Y. and Chaudhari, P · 2021
Cited alongside, same era.
Sliced-Wasserstein distances and flows on Cartan-Hadamard manifolds
Bonet, C., Drumetz, L., and Courty, N · 2024
Later among the works it cites.
Validating climate models with spherical convolutional Wasserstein distance
Garrett, R. C., Harris, T., Wang, Z., and Li, B · 2024
Later among the works it cites.
The joint effect of task similarity and overparameterization on catastrophic forgetting — an analytical model
Goldfarb, D., Evron, I., Weinberger, N., Soudry, D., and HAnd, P · 2024
Later among the works it cites.
Sliced-Wasserstein estimation with spherical harmonics as control variates
Leluc, R., Dieuleveut, A., Portier, F., Segers, J., and Zhuman, A · 2024
Later among the works it cites.
Hierarchical hybrid sliced Wasserstein: A scalable metric for heterogeneous joint distributions
Nguyen, K. and Ho, N · 2024
Later among the works it cites.
Nguyen, K. and Mueller, P · 2024
Later among the works it cites.
Quasi-monte carlo for 3d sliced Wasserstein
Nguyen, K., Bariletto, N., and Ho, N · 2024
Later among the works it cites.
Parallelly sliced optimal transport on spheres and on the rotation group
Quellmalz, M., Buecher, L., and Steidl, G · 2024
Later among the works it cites.
Stereographic spherical sliced Wasserstein distances
Tran, H., Bai, Y., Kothapalli, A., Shahbazi, A., Liu, X., Martin, R. D., and Kolouri, S · 2024
Later among the works it cites.
Sharp bounds for max-sliced wasserstein distances
Boedihardjo, M. T · 2025
Closest in time.
Wasserstein task embedding for measuring task similarities
Liu, X., Bai, Y., Lu, Y., Soltoggio, A., and Kolouri, S · 2025
Closest in time.