Slicing Wasserstein over Wasserstein via Functional Optimal Transport

ICLR 2026 Conference SubmissionAnonymous Authors
Optimal TransportSliced WassersteinDataset DistancesWassersteinFunction SpacesInfinite-dimensional
Abstract:

Wasserstein distances define a metric between probability measures on arbitrary metric spaces, including meta-measures (measures over measures). The resulting Wasserstein over Wasserstein (WoW) distance is a powerful, but computationally costly tool for comparing datasets or distributions over images and shapes. Existing sliced WoW accelerations rely on parametric meta-measures or the existence of high-order moments, leading to numerical instability. As an alternative, we propose to leverage the isometry between the 1d Wasserstein space and the quantile functions in the function space L2([0,1])L_2([0,1]). For this purpose, we introduce a general sliced Wasserstein framework for arbitrary Banach spaces. Due to the 1d Wasserstein isometry, this framework defines a sliced distance between 1d meta-measures via infinite-dimensional L2L_2-projections, parametrized by Gaussian processes. Combining this 1d construction with classical integration over the Euclidean unit sphere yields the double-sliced Wasserstein (DSW) metric for general meta-measures. We show that DSW minimization is equivalent to WoW minimization for discretized meta-measures, while avoiding unstable higher-order moments and computational savings. Numerical experiments on datasets, shapes, and images validate DSW as a scalable substitute for the WoW distance.

Disclaimer
This report is AI-GENERATED using Large Language Models and WisPaper (A scholar search engine). It analyzes academic papers' tasks and contributions against retrieved prior work. While this system identifies POTENTIAL overlaps and novel directions, ITS COVERAGE IS NOT EXHAUSTIVE AND JUDGMENTS ARE APPROXIMATE. These results are intended to assist human reviewers and SHOULD NOT be relied upon as a definitive verdict on novelty.
NOTE that some papers exist in multiple, slightly different versions (e.g., with different titles or URLs). The system may retrieve several versions of the same underlying work. The current automated pipeline does not reliably align or distinguish these cases, so human reviewers will need to disambiguate them manually.
If you have any questions, please contact: mingzhang23@m.fudan.edu.cn

Overview

Taxonomy

Core-task Taxonomy Papers
50
3
Claimed Contributions
21
Contribution Candidate Papers Compared
0
Refutable Paper

Research Landscape Overview

Core task: comparing distributions over non-Euclidean objects using optimal transport. The field has evolved into a rich taxonomy spanning seven major branches that address distinct but interconnected challenges. Computational Methods and Algorithmic Frameworks focus on efficient solvers and projection-based techniques such as sliced approaches, which reduce high-dimensional transport problems to tractable one-dimensional projections. Non-Euclidean Geometries and Manifold Structures tackle transport on curved spaces—ranging from hyperbolic geometries to Riemannian manifolds—where classical Euclidean assumptions break down. Reproducing Kernel Hilbert Spaces and Feature Embeddings leverage kernel methods to handle complex data types, while Theoretical Foundations and Mathematical Analysis provide rigorous convergence guarantees and geometric insights. Regression, Inference, and Statistical Modeling apply transport-based distances to prediction and uncertainty quantification, Applications and Domain-Specific Methods demonstrate utility in biology, recommendation systems, and medical imaging, and Specialized Formulations and Extensions explore variants like unbalanced or Gromov-Wasserstein distances that relax standard constraints. Within the computational branch, sliced and projection-based methods have emerged as a particularly active line of work, balancing scalability with approximation quality. Sliced Optimal Transport Introduction[1] and Non-Euclidean Sampling Software[47] illustrate how projections can be extended beyond Euclidean settings, while Sliced Fused Gromov-Wasserstein[22] combines slicing with structure-aware matching. The original paper, Slicing Wasserstein Functional[0], sits squarely in this projection-based cluster, contributing new theoretical or algorithmic insights into how slicing strategies generalize to non-Euclidean domains. Compared to Non-Euclidean Sliced Sampling[8], which emphasizes sampling procedures on manifolds, Slicing Wasserstein Functional[0] appears to focus more directly on the functional analytic properties of sliced transport. Meanwhile, works like Gaussian Process Wasserstein Kernels[2] and RKHS Optimal Transport[14] pursue complementary kernel-based embeddings, highlighting an ongoing trade-off between projection simplicity and the expressiveness of feature-space methods.

Claimed Contributions

General sliced Wasserstein framework for arbitrary Banach spaces

The authors develop a generalized sliced Wasserstein distance framework that extends beyond Euclidean spaces to arbitrary separable Banach spaces. This framework uses a reference measure on the dual space to define projections and establishes metric properties under suitable conditions.

10 retrieved papers
Double-sliced Wasserstein (DSW) metric for meta-measures

The authors introduce the DSW metric, which combines classical spherical slicing with infinite-dimensional L2-projections parametrized by Gaussian processes. This provides a computationally efficient alternative to the Wasserstein over Wasserstein distance for comparing distributions over distributions.

10 retrieved papers
Topological equivalence between DSW and WoW for discretized meta-measures

The authors establish that minimizing the DSW distance is equivalent to minimizing the WoW distance for empirical meta-measures. This theoretical result validates DSW as a meaningful substitute for WoW while avoiding computational and numerical stability issues.

1 retrieved paper

Core Task Comparisons

Comparisons with papers in the same taxonomy category

Contribution Analysis

Detailed comparisons for each claimed contribution

Contribution

General sliced Wasserstein framework for arbitrary Banach spaces

The authors develop a generalized sliced Wasserstein distance framework that extends beyond Euclidean spaces to arbitrary separable Banach spaces. This framework uses a reference measure on the dual space to define projections and establishes metric properties under suitable conditions.

Contribution

Double-sliced Wasserstein (DSW) metric for meta-measures

The authors introduce the DSW metric, which combines classical spherical slicing with infinite-dimensional L2-projections parametrized by Gaussian processes. This provides a computationally efficient alternative to the Wasserstein over Wasserstein distance for comparing distributions over distributions.

Contribution

Topological equivalence between DSW and WoW for discretized meta-measures

The authors establish that minimizing the DSW distance is equivalent to minimizing the WoW distance for empirical meta-measures. This theoretical result validates DSW as a meaningful substitute for WoW while avoiding computational and numerical stability issues.