Properties of Discrete Sliced Wasserstein Losses
Eloi Tanguy, R\'emi Flamary, Julie Delon

TL;DR
This paper analyzes the mathematical properties of the discrete sliced Wasserstein loss function, including regularity, optimization, and convergence, with implications for its use in machine learning applications.
Contribution
It provides a detailed study of the regularity, optimization, and convergence properties of the discrete sliced Wasserstein energy and its Monte-Carlo approximation.
Findings
Convergence of Monte-Carlo approximation to true energy at critical points
Almost-sure uniform convergence of the approximation process
SGD methods converge to Clarke critical points of the energies
Abstract
The Sliced Wasserstein (SW) distance has become a popular alternative to the Wasserstein distance for comparing probability measures. Widespread applications include image processing, domain adaptation and generative modelling, where it is common to optimise some parameters in order to minimise SW, which serves as a loss function between discrete probability measures (since measures admitting densities are numerically unattainable). All these optimisation problems bear the same sub-problem, which is minimising the Sliced Wasserstein energy. In this paper we study the properties of , i.e. the SW distance between two uniform discrete measures with the same amount of points as a function of the support of one of the measures. We investigate the regularity and optimisation properties of this…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsGeometric Analysis and Curvature Flows · Generative Adversarial Networks and Image Synthesis · Stochastic Gradient Optimization Techniques
