Conference Agenda
The sessions of the sections are highlighted in blue, those of the mini-symposia in yellow.
Please select a date or location to show only sessions at that day or location. If you click the selected day again, you return to the agenda overview.
You can also filter by sections or mini-symposia (topics). Please select a single session for detailed view with abstracts.
As participant you can create your own personal agenda. To do so, log into your account first. Then go to the agenda and click on the plus symbol to add sessions to your personal agenda.
|
Daily Overview |
| Session | |
|
OT3: Optimal Transport: Theory and Applications Location: G227 Session Chair: Stephan Eckstein Session Chair: Johannes Wiesel | |
| Presentation 1 | |
Slicing Wasserstein over Wasserstein via Functional Optimal Transport Technische Universität Berlin, Germany 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. To lower the computational burden, we propose to leverage the isometry between the 1d Wasserstein space and the quantile functions. 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 projections, parametrized by Gaussian processes. Combining this 1d construction with a second slicing of the underlying domain yields the double-sliced Wasserstein (DSW) metric for general meta-measures. Numerical experiments on datasets, shapes, and images validate DSW as a scalable substitute for the WoW distance. Moreover, our functional framework can be used to introduce a novel slicing of the Gromov-Wasserstein (GW) distance, which allows to compare shapes and heterogeneous data. Former GW slicings are restricted to the Euclidean geometry and lose the desired invariance to isometries, strongly limiting their application in practice. Our novel sliced GW lower bound significantly reduces the numerical effort while remaining invariant to isometric transformations and allowing the comparison of arbitrary geometries. | |



