Sliced Wasserstein Distance

Overview

Sliced Wasserstein distance studies how to compare distributions efficiently by projecting high-dimensional data onto lines and computing one-dimensional optimal transport, often through sorted samples or cumulative distribution functions. Methods use random or optimized directions, orthonormal bases, and extensions such as max-sliced, Orlicz, and spherical-harmonic variants to improve sensitivity or fit particular data. These distances support generative-model evaluation, domain generalization, clustering, change detection, and distribution steering, with applications ranging from images and point clouds to EEG and single-cell data. A central tension is balancing computational and statistical efficiency against how faithfully a limited set of projections captures differences in high-dimensional distributions; estimation rates and projection choices remain important open issues.

Latest papers

CardsList

18 papers3 papers in the last four weeks, level with the four weeks before. 0.0% of all new papers.

  1. Fast rigid rotational alignment of voxelized 3-D density maps in sliced Wasserstein distance

    Oct 29, 2026Oscar Mickelin, Yunpeng Shi, Amit Singer +13D Shape MatchingOptimal Transport

  2. Sliced Wasserstein Sketches with Error Certificates

    Oct 14, 2026Elaheh Akbari, James Liu, Keaton Hamm +1Sliced Wasserstein DistanceVector Quantization

  3. Vertical Sliced Wasserstein Distances for Meta-Measures

    Oct 14, 2026Elaheh Akbari, Ahmadreza Moradipari, Kyungtae Han +4Wasserstein DistanceOptimal Transport

  4. Sliced Orlicz-Wasserstein

    Sep 26, 2026Binh Thuan Tran, Khai NguyenOptimal TransportSliced Wasserstein Distance

  5. High-Dimensional Online Change Point Detection with Adaptive Thresholding and Interpretability

    Sep 21, 2026Sven Jacob, Bardh Prenkaj, Weijia Shao +1Change-Point DetectionSliced Wasserstein Distance

  6. Distribution Steering via Sliced Optimal Transport Control

    Aug 13, 2026Kaito Ito, Anqi DongFeedback ControlOptimal Control

  7. Distributional Determinantal Point Process for Repulsive Clustering of Distributions

    Jul 23, 2026Khai Nguyen, Yang Ni, Elizabeth Juarez-Colunga +1Bayesian Mixture ModelsClustering

  8. Highly Data Parallelizable Estimation of the Sliced-Wasserstein Distance Using Cumulative Distribution Functions

    Jun 29, 2026Christophe Vauthier, Quentin Mérigot, Anna KorbaSliced Wasserstein DistanceOptimal Transport

  9. A Sliced-Wasserstein Framework on Correlation Matrices for EEG Decoding

    Jun 4, 2026Chen Hu, Rui Wang, Jiale Zhou +4EEG DecodingDomain Generalization

  10. The Observable Wasserstein Distance

    May 11, 2026Edivaldo Lopes dos Santos, Leandro Vicente Mauri, Washington Mio +1Sliced Wasserstein DistanceOptimal Transport

  11. APEX: Assumption-free Projection-based Embedding eXamination Metric for Generative Distribution Evaluation

    May 8, 2026Caterina Gallegati, Monica Bianchini, Franco Scarselli +2Image Quality AssessmentImage Generation Evaluation

  12. MIND: Monge Inception Distance for Generative Models Evaluation

    May 7, 2026Quentin Berthet, Yu-Han Wu, Clement Crepy +3Image Generation EvaluationSliced Wasserstein Distance

  13. Sliced Wasserstein Steering between Gaussian Measures

    Apr 14, 2026Kaito Ito, Anqi DongOptimal TransportOptimal Control

  14. Convergence Rates for Distribution Matching with Sliced Optimal Transport

    Feb 11, 2026Gauthier Thurin, Claire Boyer, Kimia NadjahiDistribution MatchingSliced Wasserstein Distance