Stereographic Spherical Sliced Wasserstein Distances
Huy Tran, Yikun Bai, Abihith Kothapalli, Ashkan Shahbazi, Xinran Liu, Rocio Diaz Martin, Soheil Kolouri
TL;DR
This work introduces Stereographic Spherical Sliced Wasserstein (S3W), a fast, scalable distance for comparing probability measures on the sphere by projecting onto Euclidean space via stereographic projection and applying a generalized Radon transform to obtain 1D marginals. It analyzes distance distortion and proposes a rotationally invariant extension (RI-S3W) and an amortized variant (ARI-S3W) to improve robustness and efficiency. The authors provide theoretical foundations for SSRT-based slices, practical numerical implementations, and extensive experiments across gradient flows, self-supervised learning, SWAE, and Earth-density estimation, demonstrating substantial speedups and competitive accuracy relative to recent baselines. The approach opens pathways for efficient, geometry-aware probabilistic modeling on spherical domains and can be extended to unbalanced or partial OT and other manifolds. Overall, S3W and its variants offer a practical, theoretically grounded toolkit for fast spherical optimal transport in machine learning and scientific computing contexts.
Abstract
Comparing spherical probability distributions is of great interest in various fields, including geology, medical domains, computer vision, and deep representation learning. The utility of optimal transport-based distances, such as the Wasserstein distance, for comparing probability measures has spurred active research in developing computationally efficient variations of these distances for spherical probability measures. This paper introduces a high-speed and highly parallelizable distance for comparing spherical measures using the stereographic projection and the generalized Radon transform, which we refer to as the Stereographic Spherical Sliced Wasserstein (S3W) distance. We carefully address the distance distortion caused by the stereographic projection and provide an extensive theoretical analysis of our proposed metric and its rotationally invariant variation. Finally, we evaluate the performance of the proposed metrics and compare them with recent baselines in terms of both speed and accuracy through a wide range of numerical studies, including gradient flows and self-supervised learning. Our code is available at https://github.com/mint-vu/s3wd.
