Sliced Transport Plans
read the original abstract
Since the introduction of the Sliced Wasserstein distance in the literature, its simplicity and efficiency have made it one of the most interesting surrogate for the Wasserstein distance in image processing and machine learning. However, its inability to produce transport plans limits its practical use to applications where only a distance is necessary. Several heuristics have been proposed in the recent years to address this limitation when the probability measures are discrete. In this paper, we propose to study these different propositions by redefining and analysing them rigorously for generic probability measures. Leveraging the $\nu$-based Wasserstein distance and generalised geodesics, we introduce and study the Pivot Sliced Discrepancy, inspired by a recent work by Mahey et al.. We demonstrate its semi-metric properties and its relation to a constrained Kantorovich formulation. In the same way, we generalise and study the recent Expected Sliced plans introduced by Liu et al. for completely generic measures. Our theoretical contributions are supported by numerical experiments on synthetic and real datasets, including colour transfer and shape registration, evaluating the practical relevance of these different solutions.
This paper has not been read by Pith yet.
Forward citations
Cited by 5 Pith papers
-
ASAP: Amortized Doubly-Stochastic Attention via Sliced Dual Projection
ASAP amortizes Sinkhorn-based doubly-stochastic attention by learning a parametric map from 1D potentials to the Sinkhorn dual and reconstructing the plan via two-sided entropic c-transform, delivering 5.3x faster inf...
-
Sliced-Regularized Optimal Transport
SROT regularizes the OT plan toward a smoothened sliced OT plan, producing more accurate approximations to exact OT than entropic OT while also improving on the sliced OT reference.
-
Sliced-Regularized Optimal Transport
SROT regularizes the OT transport plan toward a sliced OT reference, yielding better approximations of exact OT than entropic OT and improving on the sliced OT plan itself.
-
Amortized Optimal Transport from Sliced Potentials
RA-OT and OA-OT amortize optimal transport by regressing or optimizing sliced-OT Kantorovich potentials to approximate full OT plans efficiently across multiple measure pairs.
-
Efficient Transferable Optimal Transport via Min-Sliced Transport Plans
Min-STP optimizes slicers for efficient OT that transfer under slight distributional shifts, with a minibatch formulation offering accuracy guarantees and empirical success in point cloud alignment and generative modeling.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.