On Wasserstein distances for affine transformations of random vectors
Keaton Hamm, Andrzej Korzeniowski
TL;DR
The paper addresses the problem of quantifying the Wasserstein distance $W_2$ between a distribution and its affine transformations, with a focus on rotations and their role in rotational manifolds within Wasserstein space. It leverages the Dowson–Landau lower bound and Gelbrich’s equality framework to derive explicit, covariance-based lower bounds, and in 2D derives a closed-form rotation bound using the trace of square roots of covariance products; it also provides an upper bound for compositions of translations, rotations, and dilations. Key contributions include a closed-form expression for $\operatorname{tr}[(\Sigma_{R_\theta X}\Sigma_{R_\varphi X})^{1/2}]$ and sharp lower bounds that are attained for Gaussian or elliptically contoured distributions, together with practical upper bounds for affine compositions and concrete demonstrations on 1D submanifolds and handwriting-inspired data for manifold learning via Wassmap. The work advances understanding of Wasserstein geometry under affine deformations and offers practical tools for synthetic data generation and dimensionality reduction benchmarking in applications like handwriting analysis and image-based manifold learning, while highlighting open questions about centering, symmetry, and the influence of data geometry on the tightness of the bounds.
Abstract
We expound on some known lower bounds of the quadratic Wasserstein distance between random vectors in $\mathbb{R}^n$ with an emphasis on affine transformations that have been used in manifold learning of data in Wasserstein space. In particular, we give concrete lower bounds for rotated copies of random vectors in $\mathbb{R}^2$ by computing the Bures metric between the covariance matrices. We also derive upper bounds for compositions of affine maps which yield a fruitful variety of diffeomorphisms applied to an initial data measure. We apply these bounds to various distributions including those lying on a 1-dimensional manifold in $\mathbb{R}^2$ and illustrate the quality of the bounds. Finally, we give a framework for mimicking handwritten digit or alphabet datasets that can be applied in a manifold learning framework.
