Generalized Sliced Wasserstein Distances

The Wasserstein distance and its variations, e.g., the sliced-Wasserstein (SW) distance, have recently drawn attention from the machine learning community. The SW distance, specifically, was shown to have similar properties to the Wasserstein distance, while being much simpler to compute, and is therefore used in various applications including generative modeling and general supervised/unsupervised learning. In this paper, we first clarify the mathematical connection between the SW distance and the Radon transform. We then utilize the generalized Radon transform to define a new family of distances for probability measures, which we call generalized sliced-Wasserstein (GSW) distances. We also show that, similar to the SW distance, the GSW distance can be extended to a maximum GSW (max-GSW) distance. We then provide the conditions under which GSW and max-GSW distances are indeed distances. Finally, we compare the numerical performance of the proposed distances on several generative modeling tasks, including SW flows and SW auto-encoders.

Adam: A Method forStochastic OptimizationAdam: A Method for Stochastic OptimizationAn efficient linearprogramming method for…An efficient linear programming method for Optimal TransportationA Sparse MultiscaleAlgorithm for Dense…A Sparse Multiscale Algorithm for Dense Optimal TransportA Newton algorithm forsemi-discrete optimal…A Newton algorithm for semi-discrete optimal transportWasserstein GANWasserstein GANProgressive Growing ofGANs for Improved…Progressive Growing of GANs for Improved Quality, Stability, and VariationSliced-WassersteinFlows: Nonparametric…Sliced-Wasserstein Flows: Nonparametric Generative Modeling via Optimal Transport and DiffusionsComputational OptimalTransportComputational Optimal TransportStatistical andTopological Properties…Statistical and Topological Properties of Sliced Probability DivergencesNetwork-principled deepgenerative models for…Network-principled deep generative models for designing drug combinations as graph setsTopological Learning forBrain NetworksTopological Learning for Brain NetworksIllegible Text toReadable Text: An…Illegible Text to Readable Text: An Image-to-Image Transformation using Conditional Sliced Wasserstein Adversarial NetworksEfficient Gradient Flowsin Sliced-Wasserstein…Efficient Gradient Flows in Sliced-Wasserstein SpaceSliced IterativeNormalizing FlowsSliced Iterative Normalizing FlowsActive Slices for SlicedStein DiscrepancyActive Slices for Sliced Stein DiscrepancySliced Multi-MarginalOptimal TransportSliced Multi-Marginal Optimal TransportProjection‐basedtechniques for…Projection‐based techniques for high‐dimensional optimal transport problemsOn the Acceleration ofthe Sinkhorn and…On the Acceleration of the Sinkhorn and Greenkhorn Algorithms for Optimal TransportStatistical, Robustness,and Computational…Statistical, Robustness, and Computational Guarantees for Sliced Wasserstein DistancesShedding a PAC-BayesianLight on Adaptive…Shedding a PAC-Bayesian Light on Adaptive Sliced-Wasserstein DistancesGeneralized SlicedWasserstein DistancesGeneralized Sliced Wasserstein DistancesEarlier referencesFocus paperCiting papersOlderNewer

Click a node to pin it, click the empty canvas to go back to this paper, or hover to preview. Open a node’s page from its title.