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
18 papers3 papers in the last four weeks, level with the four weeks before. 0.0% of all new papers.